1243 search results - page 135 / 249 » On the locality of bounded growth |
172
click to vote
CP
2008
Springer
15 years 8 months ago
2008
Springer
Decomposition is a powerful technique for reducing the size of a backtracking search tree. However, when solving constraint optimization problems (COP's) the standard techniqu...
148
click to vote
SIROCCO
2007
15 years 7 months ago
2007
Abstract. A large group of autonomous, mobile entities e.g. robots initially placed at some arbitrary node of the graph has to jointly visit all nodes (not necessarily all edges) a...
159
click to vote
AAAI
2006
15 years 7 months ago
2006
Set variables are ubiquitous in modeling (soft) constraint problems, but efforts on practical consistency algorithms for Weighted Constraint Satisfaction Problems (WCSPs) have onl...
158
click to vote
JGT
2007
15 years 6 months ago
2007
A well-known theorem of Mader [5] states that highly connected subgraphs can be forced in finite graphs by assuming a high minimum degree. Solving a problem of Diestel [2], we ex...
182
click to vote
ICASSP
2010
IEEE
15 years 5 months ago
2010
IEEE
The sliding window approach is the most widely used technique to detect faces in an image. Usually a classifier is applied on a regular grid and to speed up the scanning, the gri...