101 search results - page 17 / 21 » An Exact Quantum Polynomial-Time Algorithm for Simon's Probl... |
JAIR
2008
13 years 7 months ago
2008
We present exact algorithms for identifying deterministic-actions' effects and preconditions in dynamic partially observable domains. They apply when one does not know the ac...
ICALP
2005
Springer
14 years 1 months ago
2005
Springer
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...
TSMC
2011
13 years 2 months ago
2011
—Biogeography-based optimization (BBO) is a4 population-based evolutionary algorithm that is based on the5 mathematics of biogeography. Biogeography is the science and6 study of ...
CADE
2006
Springer
14 years 7 months ago
2006
Springer
Context Unification is the problem to decide for a given set of second-order equations E where all second-order variables are unary, whether there exists a unifier, such that for e...
MST
2010
13 years 6 months ago
2010
Coloring a k-colorable graph using k colors (k ≥ 3) is a notoriously hard problem. Considering average case analysis allows for better results. In this work we consider the unif...