9842 search results - page 56 / 1969 » Problem complexity |
AAAI
2012
12 years 1 days ago
2012
It has been shown recently that the complexity of belief tracking in deterministic conformant and contingent planning is exponential in a width parameter that is often bounded and...
APPROX
2004
Springer
14 years 3 months ago
2004
Springer
In this paper we investigate the computational complexity of a combinatorial problem that arises in the reverse engineering of protein and gene networks. Our contributions are as ...
ALGOSENSORS
2004
Springer
14 years 3 months ago
2004
Springer
Determining the positions of the sensor nodes in a network is essential to many network functionalities such as routing, coverage and tracking, and event detection. The localizatio...
DISOPT
2006
13 years 9 months ago
2006
We consider the multiple shift scheduling problem modelled as a covering problem. Such problems are characterized by a constraint matrix that has in every column blocks of consecu...
COCO
1989
Springer
14 years 1 months ago
1989
Springer
For a monoid G, the iterated multiplication problem is the computation of the product of n elements from G. By re ning known completeness arguments, we show that as G varies over ...