Sciweavers

5329 search results - page 300 / 1066
» The Weighted Majority Algorithm
Sort
View
CP
2003
Springer
15 years 12 months ago
Using the Breakout Algorithm to Identify Hard and Unsolvable Subproblems
Abstract. Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to de...
Carlos Eisenberg, Boi Faltings
ISLPED
1997
ACM
83views Hardware» more  ISLPED 1997»
15 years 10 months ago
A symbolic algorithm for low-power sequential synthesis
We present an algorithm that restructures the state transition graph STG of a sequential circuit so as to reduce power dissipation. The STG is modi ed without changing the behav...
Balakrishna Kumthekar, In-Ho Moon, Fabio Somenzi
FC
2006
Springer
109views Cryptology» more  FC 2006»
15 years 10 months ago
A Private Stable Matching Algorithm
Existing stable matching algorithms reveal the preferences of all participants, as well as the history of matches made and broken in the course of computing a stable match. This in...
Philippe Golle
GECCO
2000
Springer
170views Optimization» more  GECCO 2000»
15 years 10 months ago
A Comparison of Genetic Algorithms for the Dynamic Job Shop Scheduling Problem
The majority of the research using evolutionary algorithms for the Job Shop Scheduling Problem (JSSP) has studied only the static JSSP. Few evolutionary algorithms have been appli...
Manuel Vázquez, L. Darrell Whitley
BIODATAMINING
2008
85views more  BIODATAMINING 2008»
15 years 6 months ago
A review of estimation of distribution algorithms in bioinformatics
Evolutionary search algorithms have become an essential asset in the algorithmic toolbox for solving high-dimensional optimization problems in across a broad range of bioinformati...
Rubén Armañanzas, Iñaki Inza,...