Sciweavers

1082 search results - page 119 / 217
» Stability of Locally Optimal Solutions
Sort
View
ASPDAC
2005
ACM
117views Hardware» more  ASPDAC 2005»
15 years 11 months ago
Dynamic symmetry-breaking for improved Boolean optimization
With impressive progress in Boolean Satisfiability (SAT) solving and several extensions to pseudo-Boolean (PB) constraints, many applications that use SAT, such as highperformanc...
Fadi A. Aloul, Arathi Ramani, Igor L. Markov, Kare...
TJS
2002
160views more  TJS 2002»
15 years 5 months ago
Adaptive Optimizing Compilers for the 21st Century
Historically, compilers have operated by applying a fixed set of optimizations in a predetermined order. We call such an ordered list of optimizations a compilation sequence. This...
Keith D. Cooper, Devika Subramanian, Linda Torczon
GECCO
2006
Springer
170views Optimization» more  GECCO 2006»
15 years 9 months ago
Combining simplex with niche-based evolutionary computation for job-shop scheduling
We propose a hybrid algorithm (called ALPINE) between Genetic Algorithm and Dantzig's Simplex method to approximate optimal solutions for the Flexible Job-Shop Problem. Local...
Syhlin Kuah, Joc Cing Tay
CPHYSICS
2006
127views more  CPHYSICS 2006»
15 years 5 months ago
GenAnneal: Genetically modified Simulated Annealing
A modification of the standard Simulated Annealing (SA) algorithm is presented for finding the global minimum of a continuous multidimensional, multimodal function. We report resu...
Ioannis G. Tsoulos, Isaac E. Lagaris
CVPR
2008
IEEE
16 years 7 months ago
3D surface models by geometric constraints propagation
This paper proposes a technique for estimating piecewise planar models of objects from their images and geometric constraints. First, assuming a bounded noise in the localization ...
Michela Farenzena, Andrea Fusiello