Sciweavers

1171 search results - page 163 / 235
» Variable neighborhood search
Sort
View
AIM
2004
13 years 9 months ago
An AI Planning-based Tool for Scheduling Satellite Nominal Operations
Satellite domains are becoming a fashionable area of research within the AI community due to the complexity of the problems that these domains need to solve. With the current US a...
María Dolores Rodríguez-Moreno, Dani...
HEURISTICS
2008
136views more  HEURISTICS 2008»
13 years 8 months ago
Enhancing set constraint solvers with lexicographic bounds
Since their beginning in constraint programming, set solvers have been applied to a wide range of combinatorial search problems, such as bin-packing, set partitioning, circuit desi...
Andrew Sadler, Carmen Gervet
ICDM
2010
IEEE
127views Data Mining» more  ICDM 2010»
13 years 7 months ago
Learning Markov Network Structure with Decision Trees
Traditional Markov network structure learning algorithms perform a search for globally useful features. However, these algorithms are often slow and prone to finding local optima d...
Daniel Lowd, Jesse Davis
AVSS
2009
IEEE
13 years 7 months ago
Landmark Localisation in 3D Face Data
A comparison of several approaches that use graph matching and cascade filtering for landmark localisation in 3D face data is presented. For the first method, we apply the structur...
Marcelo Romero, Nick Pears

Publication
285views
14 years 1 months ago
Center of mass encoding: a self-adaptive representation with adjustable redundancy for real-valued parameters
In this paper we describe a new class of representations for realvalued parameters called Center of Mass Encoding (CoME). CoME is based on variable length strings, it is self-adap...
Claudio Mattiussi, Peter Dürr, Dario Floreano