Sciweavers

1197 search results - page 23 / 240
» Which Dynamic Constraint Problems Can Be Solved By Ants
Sort
View
EAAI
2010
86views more  EAAI 2010»
15 years 5 months ago
Resolution of nonlinear interval problems using symbolic interval arithmetic
: An interval problem is a problem where the unknown variables take interval values. Such a problem can be defined by interval constraints, such as "the interval [a, b] [a, b...
Luc Jaulin, Gilles Chabert
AAAI
2000
15 years 7 months ago
Iterative Flattening: A Scalable Method for Solving Multi-Capacity Scheduling Problems
One challenge for research in constraint-based scheduling has been to produce scalable solution procedures under fairly general representational assumptions. Quite often, the comp...
Amedeo Cesta, Angelo Oddi, Stephen F. Smith
CP
2005
Springer
15 years 11 months ago
Conditional Symmetry Breaking
Conditional symmetry arises in a sub-problem of a constraint satisfaction problem, where the sub-problem satisfies some condition under which additional symetries hold. Typically...
Ian P. Gent, Tom Kelsey, Steve Linton, Iain McDona...
ICSOC
2010
Springer
15 years 4 months ago
A Soft Constraint-Based Approach to QoS-Aware Service Selection
Abstract. Service-based systems should be able to dynamically seek replacements for faulty or underperforming services, thus performing self-healing. It may however be the case tha...
Mohamed Anis Zemni, Salima Benbernou, Manuel Carro
DIS
2009
Springer
16 years 7 days ago
A Dialectic Approach to Problem-Solving
We analyze the dynamics of problem-solving in a framework which captures two key features of that activity. The first feature is that problem-solving is a social game where a numb...
Éric Martin, Jean Sallantin