2343 search results - page 74 / 469 » Visual-Concept Search Solved |
128
click to vote
CP
2005
Springer
15 years 9 months ago
2005
Springer
This paper describes a hybrid approach to solving large-scale constraint satisfaction and optimization problems. It describes a hybrid algorithm for integer linear programming whic...
147
click to vote
CP
2004
Springer
15 years 8 months ago
2004
Springer
Many combinatorial (optimisation) problems have natural models based on, or including, set variables and set constraints. This was already known to the constraint programming commu...
126
click to vote
UAI
2008
15 years 5 months ago
2008
This paper develops a measure for bounding the performance of AND/OR search algorithms for solving a variety of queries over graphical models. We show how drawing a connection to ...
144
click to vote
BNCOD
2004
15 years 5 months ago
2004
Abstract. We present a new application for keyword search within relational databases, which uses a novel algorithm to solve the join discovery problem by finding Memex-like trails...
138
click to vote
AI
2006
Springer
15 years 4 months ago
2006
Springer
Branch-and-bound and branch-and-cut use search trees to identify optimal solutions to combinatorial optimization problems. In this paper, we introduce an iterative search strategy...