Sciweavers

17 search results - page 2 / 4
» Model-Based Search for Combinatorial Optimization: A Critica...
Sort
View
PDCN
2004
13 years 10 months ago
Scalable parallel algorithms for difficult combinatorial problems: A case study in optimization
A novel combination of emergent algorithmic methods, powerful computational platforms and supporting infrastructure is described. These complementary tools and technologies are us...
Faisal N. Abu-Khzam, Michael A. Langston, Pushkar ...
GECCO
2007
Springer
154views Optimization» more  GECCO 2007»
14 years 2 months ago
Finding critical backbone structures with genetic algorithms
This paper introduces the concept of a critical backbone as a minimal set of variables or part of the solution necessary to be within the basin of attraction of the global optimum...
Adam Prügel-Bennett
ICIAP
2005
ACM
14 years 8 months ago
Scatter Search Particle Filter for 2D Real-Time Hands and Face Tracking
This paper presents the scatter search particle filter (SSPF) algorithm and its application to real-time hands and face tracking. SSPF combines sequential Monte Carlo (particle fil...
Antonio S. Montemayor, Juan José Pantrigo, ...
ICCAD
1999
IEEE
153views Hardware» more  ICCAD 1999»
14 years 26 days ago
Cycle time and slack optimization for VLSI-chips
We consider the problem of finding an optimal clock schedule, i.e. optimal arrival times for clock signals at latches of a VLSI chip. We describe a general model which includes al...
Christoph Albrecht, Bernhard Korte, Jürgen Sc...
ILP
2004
Springer
14 years 1 months ago
A Monte Carlo Study of Randomised Restarted Search in ILP
Recent statistical performance surveys of search algorithms in difficult combinatorial problems have demonstrated the benefits of randomising and restarting the search procedure. ...
Filip Zelezný, Ashwin Srinivasan, David Pag...