11 search results - page 2 / 3 » Enhancements of Branch and Bound Methods for the Maximal Con... |
AI
1999
Springer
13 years 4 months ago
1999
Springer
Bucket elimination is an algorithmic framework that generalizes dynamic programming to accommodate many problem-solving and reasoning tasks. Algorithms such as directional-resolut...
EVOW
2010
Springer
13 years 9 months ago
2010
Springer
Instances of constraint satisfaction problems can be solved efficiently if they are representable as a tree decomposition of small width. Unfortunately, the task of finding a deco...
AI
2010
Springer
13 years 5 months ago
2010
Springer
The Valued Constraint Satisfaction Problem (VCSP) is a generic optimization problem defined by a network of local cost functions defined over discrete variables. It has applicatio...
CVPR
2012
IEEE
11 years 7 months ago
2012
IEEE
Real-time recognition may be limited by scarce memory and computing resources for performing classification. Although, prior research has addressed the problem of training classif...
IPPS
2007
IEEE
13 years 11 months ago
2007
IEEE
Replicating data objects onto servers across a system can alleviate access delays. The selection of data objects and servers requires solving a constraint optimization problem, wh...