Sciweavers

1589 search results - page 137 / 318
» Constraints with Variables' Annotations
Sort
View
CORR
2010
Springer
136views Education» more  CORR 2010»
13 years 6 months ago
Schaefer's theorem for graphs
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
Manuel Bodirsky, Michael Pinsker
AI
2005
Springer
13 years 8 months ago
The distributed breakout algorithms
We present a new series of distributed constraint satisfaction algorithms, the distributed breakout algorithms, which is inspired by local search algorithms for solving the constr...
Katsutoshi Hirayama, Makoto Yokoo
BMCBI
2004
146views more  BMCBI 2004»
13 years 8 months ago
The InDeVal insertion/deletion evaluation tool: a program for finding target regions in DNA sequences and for aiding in sequence
Background: The program InDeVal was originally developed to help researchers find known regions of insertion/deletion activity (with the exception of isolated single-base indels) ...
Sierra D. Stoneberg Holt, Jason A. Holt
GECCO
2007
Springer
172views Optimization» more  GECCO 2007»
14 years 3 months ago
Real-coded ECGA for economic dispatch
In this paper, we propose a new approach that consists of the extended compact genetic algorithm (ECGA) and split-ondemand (SoD), an adaptive discretization technique, to economic...
Chao-Hong Chen, Ying-Ping Chen
CSCLP
2008
Springer
13 years 10 months ago
Robust Solutions in Unstable Optimization Problems
We consider constraint optimization problems where costs (or preferences) are all given, but some are tagged as possibly unstable, and provided with a range of alternative values. ...
Maria Silvia Pini, Francesca Rossi, Kristen Brent ...