3825 search results - page 265 / 765 » The Language of Time: A Reader |
178
click to vote
AAAI
2006
15 years 8 months ago
2006
We present an algorithm that derives actions' effects and preconditions in partially observable, relational domains. Our algorithm has two unique features: an expressive rela...
156
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
We give a polynomial time algorithm that computes a decomposition of a finite group G given in the form of its multiplication table. That is, given G, the algorithm outputs two su...
165
click to vote
ICALP
2009
Springer
16 years 1 months ago
2009
Springer
Let Φ be a uniformly distributed random k-SAT formula with n variables and m clauses. We present a polynomial time algorithm that finds a satisfying assignment of Φ with high p...
159
click to vote
CP
2007
Springer
16 years 24 days ago
2007
Springer
Deviation is a recent constraint to balance a set of variables with respect to a given mean. We show that the propagators recently introduced are not bound-consistent when the mean...
148
click to vote
CP
2005
Springer
16 years 4 days ago
2005
Springer
Methods exploiting tree-decompositions seem to provide the best approach for solving constraint networks w.r.t. the theoretical time complexity. However, they have not shown a real...