1478 search results - page 11 / 296 » Modular Complexity Analysis via Relative Complexity |
COCO
1995
Springer
13 years 11 months ago
1995
Springer
For the worst-case complexity measure, if P = NP, then P = OptP, i.e., all NP optimization problems are polynomial-time solvable. On the other hand, it is not clear whether a simi...
BMCBI
2007
13 years 7 months ago
2007
Background: Microarray compendia profile the expression of genes in a number of experimental conditions. Such data compendia are useful not only to group genes and conditions base...
JITECH
2010
13 years 6 months ago
2010
We propose a design theory that tackles dynamic complexity in the design for Information Infrastructures (IIs) defined as a shared, open, heterogeneous and evolving socio-technica...
INFOCOM
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract—We study the joint power control and minimumframe-length scheduling problem in wireless networks, under the physical interference model and subject to consecutive transm...
ICDAR
2003
IEEE
14 years 28 days ago
2003
IEEE
Structure analysis of table form document is important because printed documents and also electronical documents only provide geometrical layout and lexical information explicitly...