Sciweavers

9119 search results - page 328 / 1824
» A Simultaneous Search Problem
Sort
View
MICRO
1990
IEEE
147views Hardware» more  MICRO 1990»
15 years 10 months ago
Motivation and framework for using genetic algorithms for microcode compaction
Genetic algorithms are a robust adaptive optimization technique based on a biological paradigm. They perform efficient search on poorly-defined spaces by maintaining an ordered po...
Steven J. Beaty, Darrell Whitley, Gearold Johnson
ECAI
2006
Springer
15 years 10 months ago
Random Subset Optimization
Some of the most successful algorithms for satisfiability, such as Walksat, are based on random walks. Similarly, local search algorithms for solving constraint optimization proble...
Boi Faltings, Quang Huy Nguyen
COR
2006
98views more  COR 2006»
15 years 6 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
167
Voted
ICML
2007
IEEE
16 years 7 months ago
Uncovering shared structures in multiclass classification
This paper suggests a method for multiclass learning with many classes by simultaneously learning shared characteristics common to the classes, and predictors for the classes in t...
Yonatan Amit, Michael Fink 0002, Nathan Srebro, Sh...
CP
2006
Springer
15 years 10 months ago
General Symmetry Breaking Constraints
We describe some new propagators for breaking symmetries in constraint satisfaction problems. We also introduce symmetry breaking constraints to deal with symmetries acting simulta...
Toby Walsh