77 search results - page 10 / 16 » Enumeration Reducibility with Polynomial Time Bounds |
AAAI
2007
13 years 9 months ago
2007
We present in this paper a hybrid planning system which combines constraint satisfaction techniques and planning heuristics to produce optimal sequential plans. It integrates its ...
SODA
2010
ACM
14 years 4 months ago
2010
ACM
Bidimensionality theory appears to be a powerful framework in the development of meta-algorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...
COCOON
2003
Springer
14 years 20 days ago
2003
Springer
Drugs and other chemical compounds are often modeled as polygonal shapes, where each vertex represents an atom of the molecule, and covalent bonds between atoms are represented by...
INFOCOM
2011
IEEE
12 years 11 months ago
2011
IEEE
—To better support interactive applications, individual network operators are decreasing the timers that affect BGP convergence, leading to greater diversity in the timer setting...
TIT
2008
13 years 7 months ago
2008
We present error-correcting codes that achieve the information-theoretically best possible trade-off between the rate and error-correction radius. Specifically, for every 0 < R...