Search results
Results from the WOW.Com Content Network
The main academic full-text databases are open archives or link-resolution services, although others operate under different models such as mirroring or hybrid publishers. Such services typically provide access to full text and full-text search, but also metadata about items for which no full text is available.
Dielectrics and Electrical Insulation, IEEE Transactions on. Display Technology, Journal of. Earth Observations and Remote Sensing, IEEE Journal of Selected Topics in Applied. Education, IEEE Transactions on. Electrical and Computer Engineering, Canadian Journal of. Electromagnetic Compatibility, IEEE Transactions on.
ISO/IEC/IEEE 12207 Systems and software engineering – Software life cycle processes[ 1] is an international standard for software lifecycle processes. First introduced in 1995, it aims to be a primary standard that defines all the processes required for developing and maintaining software systems, including the outcomes and/or activities of ...
IEEE Xplore. IEEE Xplore (stylized as IEEE Xplore) digital library is a research database for discovery and access to journal articles, conference proceedings, technical standards, and related materials on computer science, electrical engineering and electronics, and allied fields. [ 2][ 3] It contains material published mainly by the Institute ...
Online access. IEEE Communications Surveys & Tutorialsis a quarterly peer-reviewedacademic journalpublished by the IEEE Communications Societyfor tutorialsand surveyscovering all aspects of the communications field. The journal publishes both original articles and reprints of articles featured in other IEEE Communication Society journals.
IEEE 802. IEEE 802 is a family of Institute of Electrical and Electronics Engineers (IEEE) standards for local area networks (LANs), personal area networks (PANs), and metropolitan area networks (MANs). The IEEE 802 LAN/MAN Standards Committee (LMSC) maintains these standards.
The P versus NP problem is a major unsolved problem in theoretical computer science. Informally, it asks whether every problem whose solution can be quickly verified can also be quickly solved. Here, quickly means an algorithm that solves the task and runs in polynomial time exists, meaning the task completion time varies as a polynomial ...
Get AOL Mail for FREE! Manage your email like never before with travel, photo & document views. Personalize your inbox with themes & tabs. You've Got Mail!