Sciweavers

257 search results - page 3 / 52
» A (Somewhat) New Solution to the Variable Binding Problem
Sort
View
AAAI
1994
13 years 8 months ago
Solution Reuse in Dynamic Constraint Satisfaction Problems
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environ...
Gérard Verfaillie, Thomas Schiex
CORR
2008
Springer
156views Education» more  CORR 2008»
13 years 7 months ago
Artificial Immune Systems (AIS) - A New Paradigm for Heuristic Decision Making
Over the last few years, more and more heuristic decision making techniques have been inspired by nature, e.g. evolutionary algorithms, ant colony optimisation and simulated annea...
Uwe Aickelin
NIPS
2008
13 years 8 months ago
Predicting the Geometry of Metal Binding Sites from Protein Sequence
Metal binding is important for the structural and functional characterization of proteins. Previous prediction efforts have only focused on bonding state, i.e. deciding which prot...
Paolo Frasconi, Andrea Passerini
EOR
2007
90views more  EOR 2007»
13 years 7 months ago
Accelerating column generation for variable sized bin-packing problems
In this paper, we study different strategies to stabilize and accelerate the column generation method, when it is applied specifically to the variable sized bin-packing problem,...
Cláudio Alves, José M. Valéri...
MP
2006
77views more  MP 2006»
13 years 7 months ago
Zigzag inequalities: a new class of facet-inducing inequalities for Arc Routing Problems
In this paper we introduce a new class of facet-inducing inequalities for the Windy Rural Postman Problem and the Windy General Routing Problem. These inequalities are called Zigz...
Angel Corberán, Isaac Plana, José M....