388 search results - page 58 / 78 » Quantum Lower Bounds by Polynomials |
MP
2007
13 years 8 months ago
2007
We present a probabilistic analysis of integer linear programs (ILPs). More specifically, we study ILPs in a so-called smoothed analysis in which it is assumed that first an adve...
ICRA
2010
IEEE
13 years 7 months ago
2010
IEEE
— This paper presents a thorough analysis of the computational complexity of optimal reconfiguration planning problem for chain-type modular robots, i.e. finding the least number...
COLT
2010
Springer
13 years 6 months ago
2010
Springer
In recent years analysis of complexity of learning Gaussian mixture models from sampled data has received significant attention in computational machine learning and theory commun...
EJC
2008
13 years 8 months ago
2008
It is known that every constraint-satisfaction problem (CSP) reduces, and is in fact polynomially equivalent, to a digraph coloring problem. By carefully analyzing the constructio...
JMLR
2006
13 years 8 months ago
2006
Fast and frugal heuristics are well studied models of bounded rationality. Psychological research has proposed the take-the-best heuristic as a successful strategy in decision mak...