14158 search results - page 126 / 2832 » Generalized switch-setting problems |
120
click to vote
CAV
2009
Springer
15 years 10 months ago
2009
Springer
The DPLL approach to the Boolean satisfiability problem (SAT) is a combination of search for a satisfying assignment and logical deduction, in which each process guides the other....
136
click to vote
CIKM
2009
Springer
15 years 9 months ago
2009
Springer
Traditional boosting algorithms for the ranking problems usually employ the pairwise approach and convert the document rating preference into a binary-value label, like RankBoost....
171
click to vote
SMA
2009
ACM
15 years 9 months ago
2009
ACM
We examine the problem of computing exactly the Delaunay graph (and the dual Voronoi diagram) of a set of, possibly intersecting, smooth convex pseudo-circles in the Euclidean pla...
137
click to vote
IROS
2006
IEEE
15 years 9 months ago
2006
IEEE
Abstract— We study the problem of registering local relative pose estimates to produce a global consistent trajectory of a moving robot. Traditionally, this problem has been stud...
132
click to vote
AI
2003
Springer
15 years 8 months ago
2003
Springer
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to constraints. While solving a CSP is an NP-complet...