Sciweavers

1142 search results - page 21 / 229
» Set Variables and Local Search
Sort
View
MICAI
2004
Springer
14 years 3 months ago
A Preprocessing That Combines Heuristic and Surrogate Constraint Analysis to Fix Variables in TSP
A preprocessing procedure that uses a local guided search defined in terms of a neighborhood structure to get a feasible solution (UB) and the Osorio and Glover[18, 20] exploiting ...
María Auxilio Osorio Lama, David Pinto
ECAI
2010
Springer
13 years 10 months ago
Variable Level-Of-Detail Motion Planning in Environments with Poorly Predictable Bodies
Motion planning in dynamic environments consists of the generation of a collision-free trajectory from an initial to a goal state. When the environment contains uncertainty, preven...
Stefan Zickler, Manuela M. Veloso
IPPS
2006
IEEE
14 years 4 months ago
Parallel multiple sequence alignment with local phylogeny search by simulated annealing
The problem of multiple sequence alignment is one of the most important problems in computational biology. In this paper we present a new method that simultaneously performs multi...
Jaroslaw Zola, Denis Trystram, Andrei Tchernykh, C...
SOCO
2012
Springer
12 years 5 months ago
Variable mesh optimization for continuous optimization problems
Abstract Population-based meta-heuristics are algorithms that can obtain very good results for complex continuous optimization problems in a reduced amount of time. These search al...
Amilkar Puris, Rafael Bello, Daniel Molina, Franci...
IJAR
2010
113views more  IJAR 2010»
13 years 8 months ago
A geometric view on learning Bayesian network structures
We recall the basic idea of an algebraic approach to learning Bayesian network (BN) structures, namely to represent every BN structure by a certain (uniquely determined) vector, c...
Milan Studený, Jirí Vomlel, Raymond ...