135 search results - page 20 / 27 » Fixed-Point Definability and Polynomial Time |
EWSN
2004
Springer
14 years 7 months ago
2004
Springer
We consider the problem of inter-cluster routing between cluster heads via intermediate sensor nodes in a hierarchical sensor network. Sensor nodes having limited and unreplenishab...
CAV
2010
Springer
13 years 11 months ago
2010
Springer
Often one has a preference order among the different systems that satisfy a given specification. Under a probabilistic assumption about the possible inputs, such a preference order...
COCOA
2008
Springer
13 years 9 months ago
2008
Springer
We study the parameterized complexity of the following problem: is it possible to make a given graph r-regular by applying at most k elementary editing operations; the operations a...
COLT
2008
Springer
13 years 9 months ago
2008
Springer
We define a model of learning probabilistic acyclic circuits using value injection queries, in which an arbitrary subset of wires is set to fixed values, and the value on the sing...
IJCAI
2003
13 years 9 months ago
2003
Many of standard practical techniques of solving constraint satisfaction problems use various decomposition methods to represent a problem as a combination of smaller ones. We stu...