592 search results - page 51 / 119 » Using Constraint Programming to Solve the Maximum Clique Pro... |
138
click to vote
SARA
2009
Springer
15 years 9 months ago
2009
Springer
MINLP problems are hard constrained optimization problems, with nonlinear constraints and mixed discrete continuous variables. They can be solved using a Branch-and-Bound scheme c...
125
click to vote
TVCG
2011
14 years 10 months ago
2011
—Metro maps are schematic diagrams of public transport networks that serve as visual aids for route planning and navigation tasks. It is a challenging problem in network visualiz...
116
click to vote
ISF
2008
15 years 2 months ago
2008
In this study, a mathematical model is suggested concerning the location of VHF/UHF frequency radio jammer systems to the terrain parts to conduct single frequency or sequential fr...
134
click to vote
IPCO
2008
15 years 4 months ago
2008
Orbital branching is a method for branching on variables in integer programming that reduces the likelihood of evaluating redundant, isomorphic nodes in the branch-and-bound proce...
288
click to vote
Book
Markov random field (MRF) theory provides a basis for modeling contextual constraints in visual processing and interpretation. It enables us to develop optimal vision algorithms sy...