Sciweavers

338 search results - page 2 / 68
» Improved Limited Discrepancy Search
Sort
View
COR
2006
98views more  COR 2006»
13 years 4 months ago
Exploiting semidefinite relaxations in constraint programming
Constraint programming uses enumeration and search tree pruning to solve combinatorial optimization problems. In order to speed up this solution process, we investigate the use of...
Willem Jan van Hoeve
CEC
2008
IEEE
13 years 11 months ago
Improved Particle Swarm Optimization with low-discrepancy sequences
— Quasirandom or low discrepancy sequences, such as the Van der Corput, Sobol, Faure, Halton (named after their inventors) etc. are less random than a pseudorandom number sequenc...
Millie Pant, Radha Thangaraj, Crina Grosan, Ajith ...
CP
1998
Springer
13 years 9 months ago
Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems
We use a local search method we term Large Neighbourhood Search (LNS) for solving vehicle routing problems. LNS meshes well with constraint programming technology and is analogous...
Paul Shaw
VRST
2009
ACM
13 years 11 months ago
Judgment of natural perspective projections in head-mounted display environments
The display units integrated in todays head-mounted displays (HMDs) provide only a limited field of view (FOV) to the virtual world. In order to present an undistorted view to th...
Frank Steinicke, Gerd Bruder, Klaus Hinrichs, Scot...
APBC
2004
154views Bioinformatics» more  APBC 2004»
13 years 6 months ago
Dispensation Order Generation for Pyrosequencing
This article describes a dispensation order generation algorithm for genotyping using the Pyrosequencing method. The input template of the algorithm is a slightly restricted regul...
Mats Carlsson, Nicolas Beldiceanu