697 search results - page 72 / 140 » On the Theory of Average Case Complexity |
STACS
2009
Springer
14 years 2 months ago
2009
Springer
The homomorphism problem for relational structures is an abstract way of formulating constraint satisfaction problems (CSP) and various problems in database theory. The decision ve...
AGTIVE
2007
Springer
14 years 2 months ago
2007
Springer
In collaborative ontology engineering, contexts are key to manage the complexity of different dependency types between ontological artefacts. Instead of being frustrated by out-of...
SIGECOM
2006
ACM
14 years 1 months ago
2006
ACM
We present a reduction from graphical games to Markov random fields so that pure Nash equilibria in the former can be found by statistical inference on the latter. Our result, wh...
GECCO
2005
Springer
14 years 1 months ago
2005
Springer
Various algorithms have been developed and applied to structural optimization, in which cross-sectional areas of structure members are assumed to be continuous. In most cases of p...
DIALM
2004
ACM
14 years 1 months ago
2004
ACM
In many applications of wireless ad hoc and sensor networks, position-awareness is of great importance. Often, as in the case of geometric routing, it is sufficient to have virtua...