1964 search results - page 320 / 393 » Partitioning Based Algorithms for Some Colouring Problems |
142
click to vote
APPROX
2011
Springer
14 years 1 months ago
2011
Springer
How to color 3 colorable graphs with few colors is a problem of longstanding interest. The best polynomial-time algorithm uses n0.2072 colors. There are no indications that colori...
113
click to vote
ATAL
2007
Springer
15 years 8 months ago
2007
Springer
Reinforcement learning promises a generic method for adapting agents to arbitrary tasks in arbitrary stochastic environments, but applying it to new real-world problems remains di...
171
click to vote
TR
2010
14 years 8 months ago
2010
Software testing is an important issue in software engineering. As software systems become increasingly large and complex, the problem of how to optimally allocate the limited test...
114
click to vote
CVPR
2003
IEEE
16 years 4 months ago
2003
IEEE
In this paper, a novel method to learn the intrinsic object structure for robust visual tracking is proposed. The basic assumption is that the parameterized object state lies on a...
104
click to vote
LPNMR
2009
Springer
15 years 8 months ago
2009
Springer
Circumscription is one of the most important formalisms for reasoning with incomplete information. It is equivalent to reasoning under the extended closed world assumption, which a...