Sciweavers

2738 search results - page 72 / 548
» The Frobenius Problem and Its Generalizations
Sort
View
EVOW
2003
Springer
14 years 3 months ago
Search Space Analysis of the Linear Ordering Problem
Abstract. The Linear Ordering Problem (LOP) is an NP-hard combinatorial optimization problem that arises in a variety of applications and several algorithmic approaches to its solu...
Tommaso Schiavinotto, Thomas Stützle
CEC
2009
IEEE
14 years 2 months ago
A conflict based SAW method for Constraint Satisfaction Problems
Evolutionary algorithms have employed the SAW (Stepwise Adaptation of Weights) method in order to solve CSPs (Constraint Satisfaction Problems). This method originated in hill-clim...
Rafi Shalom, Mireille Avigal, Ron Unger
GLVLSI
2010
IEEE
168views VLSI» more  GLVLSI 2010»
13 years 10 months ago
A revisit to voltage partitioning problem
We revisit voltage partitioning problem when the mapped voltages of functional units are predetermined. If energy consumption is estimated by formulation E = CV 2 , a published wo...
Tao Lin, Sheqin Dong, Bei Yu, Song Chen, Satoshi G...
AI
2004
Springer
13 years 10 months ago
Version spaces and the consistency problem
A version space is a collection of concepts consistent with a given set of positive and negative examples. Mitchell [Mit82] proposed representing a version space by its boundary s...
Haym Hirsh, Nina Mishra, Leonard Pitt
GECCO
2004
Springer
147views Optimization» more  GECCO 2004»
14 years 3 months ago
A Demonstration of Neural Programming Applied to Non-Markovian Problems
Genetic programming may be seen as a recent incarnation of a long-held goal in evolutionary computation: to develop actual computational devices through evolutionary search. Geneti...
Gabriel Catalin Balan, Sean Luke