592 search results - page 19 / 119 » Using Constraint Programming to Solve the Maximum Clique Pro... |
145
click to vote
ICCV
2011
IEEE
14 years 2 months ago
2011
IEEE
We present a generalized subgraph preconditioning (GSP) technique to solve large-scale bundle adjustment problems efficiently. In contrast with previous work which uses either di...
113
click to vote
JFP
2002
15 years 2 months ago
2002
We systematically develop a functional program that solves the countdown problem, a numbers game in which the aim is to construct arithmetic expressions satisfying certain constra...
132
Voted
SAT
2007
Springer
15 years 8 months ago
2007
Springer
Integer Linear Programs are widely used in areas such as routing problems, scheduling analysis and optimization, logic synthesis, and partitioning problems. As many of these proble...
113
click to vote
BIRD
2007
Springer
15 years 8 months ago
2007
Springer
Comparison of 3-dimensional protein folds is a core problem in molecular biology. The Contact Map Overlap (CMO) scheme provides one of the most common measures for protein structur...
98
Voted
CONSTRAINTS
2000
15 years 2 months ago
2000
The vehicle routing problem (VRP) is a variant of the familiar travelling salesperson problem (TSP). In the VRP we are to perform a number of visits, using a number of vehicles of ...