2412 search results - page 86 / 483 » Which Problems Have Strongly Exponential Complexity |
117
click to vote
HICSS
2002
IEEE
15 years 8 months ago
2002
IEEE
The central question of this paper is: How can design of Program Management contribute to the success of complex software implementations? Incomplete goal specifications, lack of ...
124
click to vote
IJCBDD
2010
15 years 1 months ago
2010
: The explosion of highthroughput interaction data from proteomics studies gives us the opportunity to integrate Protein-Protein Interactions (PPI) from different type of interacti...
132
click to vote
FOCS
2006
IEEE
15 years 9 months ago
2006
IEEE
We convert cell-probe lower bounds for polynomial space into stronger lower bounds for near-linear space. Our technique applies to any lower bound proved through the richness meth...
135
click to vote
ISMVL
2000
IEEE
15 years 7 months ago
2000
IEEE
Signed conjunctive normal form (signed CNF) is a classical conjunctive clause form using a generalized notion of literal, called signed atom. A signed atom is an expression of the...
153
Voted
ATAL
2008
Springer
15 years 5 months ago
2008
Springer
Complete algorithms have been proposed to solve problems modelled as distributed constraint optimization (DCOP). However, there are only few attempts to address real world scenari...