1536 search results - page 18 / 308 » Approximately Dominating Representatives |
ICFP
2003
ACM
14 years 7 months ago
2003
ACM
Under the widely believed conjecture P=NP, NP-complete problems cannot be solved exactly using efficient polynomial time algorithms. Furthermore, any instance of a NP-complete pro...
GMP
2006
IEEE
14 years 1 months ago
2006
IEEE
A voxelization technique and its applications for objects with arbitrary topology are presented. It converts a free-form object from its continuous geometric representation into a ...
NIPS
2000
13 years 9 months ago
2000
The problem of reinforcement learning in large factored Markov decision processes is explored. The Q-value of a state-action pair is approximated by the free energy of a product o...
COCOA
2008
Springer
13 years 9 months ago
2008
Springer
Abstract: Recently, there have been significant theoretical progresses towards fixed-parameter algorithms for the DOMINATING SET problem of planar graphs. It is known that the prob...
MOBIHOC
2008
ACM
14 years 7 months ago
2008
ACM
Dealing with interference is one of the primary challenges to solve in the design of protocols for wireless ad-hoc networks. Most of the work in the literature assumes localized o...