29908 search results - page 373 / 5982 » On the Complexity of |
171
click to vote
AIPS
2009
15 years 8 months ago
2009
A planning problem is k-dependent if each action has at most k pre-conditions on variables unaffected by the action. This concept is well-founded since k is a constant for all but...
137
click to vote
ATVA
2010
Springer
15 years 8 months ago
2010
Springer
In this paper we study the fault codiagnosis problem for discrete event systems given by finite automata (FA) and timed systems given by timed automata (TA). We provide a uniform c...
201
click to vote
FOCS
2008
IEEE
15 years 8 months ago
2008
IEEE
We consider random instances of constraint satisfaction problems where each variable has domain size O(1), each constraint is on O(1) variables and the constraints are chosen from...
162
click to vote
FSTTCS
2008
Springer
15 years 8 months ago
2008
Springer
A sup-interpretation is a tool which provides upper bounds on the size of the values computed by the function symbols of a program. Sup-interpretations have shown their interest to...
180
click to vote
GLOBECOM
2008
IEEE
15 years 8 months ago
2008
IEEE
—In this paper, we present a near ML-achieving sphere search technique that reduces the number of search operations significantly over existing sphere decoding (SD) algorithms. ...