1964 search results - page 325 / 393 » Partitioning Based Algorithms for Some Colouring Problems |
144
click to vote
COLT
2008
Springer
15 years 3 months ago
2008
Springer
A pseudo-Boolean function is a real-valued function defined on {0, 1}n . A k-bounded function is a pseudo-Boolean function that can be expressed as a sum of subfunctions each of w...
118
click to vote
3DPVT
2006
IEEE
15 years 8 months ago
2006
IEEE
In this paper, we show the importance and feasibility of much faster multi-view stereo reconstruction algorithms relying almost exclusively on graphics hardware. Reconstruction al...
128
click to vote
COCO
2005
Springer
15 years 7 months ago
2005
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
145
click to vote
ATAL
2005
Springer
15 years 7 months ago
2005
Springer
Reinforcement learning problems are commonly tackled with temporal difference methods, which use dynamic programming and statistical sampling to estimate the long-term value of ta...
143
click to vote
IWCMC
2010
ACM
15 years 7 months ago
2010
ACM
Wireless ad hoc networks consist of hundreds to thousands of mobile nodes that are powered by batteries. To prolong the network operational time, energy conservation in such netwo...