Sciweavers

2109 search results - page 60 / 422
» Solving Necklace Constraint Problems
Sort
View
BMCBI
2010
116views more  BMCBI 2010»
15 years 4 months ago
A hybrid approach to protein folding problem integrating constraint programming with local search
Background: The protein folding problem remains one of the most challenging open problems in computational biology. Simplified models in terms of lattice structure and energy func...
Abu Zafer M. Dayem Ullah, Kathleen Steinhöfel
AAAI
1994
15 years 5 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
CP
2008
Springer
15 years 6 months ago
Elicitation Strategies for Fuzzy Constraint Problems with Missing Preferences: Algorithms and Experimental Studies
Fuzzy constraints are a popular approach to handle preferences and over-constrained problems in scenarios where one needs to be cautious, such as in medical or space applications. ...
Mirco Gelain, Maria Silvia Pini, Francesca Rossi, ...
CP
1998
Springer
15 years 8 months ago
Optimizing with Constraints: A Case Study in Scheduling Maintenance of Electric Power Units
A well-studied problem in the electric power industry is that of optimally scheduling preventative maintenance of power generating units within a power plant. We show how these pr...
Daniel Frost, Rina Dechter
SIGECOM
2011
ACM
232views ECommerce» more  SIGECOM 2011»
14 years 7 months ago
Near optimal online algorithms and fast approximation algorithms for resource allocation problems
We present algorithms for a class of resource allocation problems both in the online setting with stochastic input and in the offline setting. This class of problems contains man...
Nikhil R. Devanur, Kamal Jain, Balasubramanian Siv...