Sciweavers

1480 search results - page 91 / 296
» Ants can solve constraint satisfaction problems
Sort
View
AGP
1999
IEEE
15 years 2 months ago
ACI1 constraints
Disunification is the problem of deciding satisfiability of a system of equations and disequations with respect to a given equational theory. In this paper we study the disunifica...
Agostino Dovier, Carla Piazza, Enrico Pontelli, Gi...
MP
2008
137views more  MP 2008»
14 years 9 months ago
Valid inequalities and restrictions for stochastic programming problems with first order stochastic dominance constraints
Stochastic dominance relations are well-studied in statistics, decision theory and economics. Recently, there has been significant interest in introducing dominance relations into...
Nilay Noyan, Andrzej Ruszczynski
EUROGP
1999
Springer
166views Optimization» more  EUROGP 1999»
15 years 2 months ago
Adapting the Fitness Function in GP for Data Mining
In this paper we describe how the Stepwise Adaptation of Weights (saw) technique can be applied in genetic programming. The saw-ing mechanism has been originally developed for and ...
Jeroen Eggermont, A. E. Eiben, Jano I. van Hemert
AAAI
2007
15 years 3 days ago
A Distributed Constraint Optimization Solution to the P2P Video Streaming Problem
The future success of application layer video multicast depends on the availability of video stream distribution methods that can scale in the number of stream senders and receive...
Theodore Elhourani, Nathan Denny, Michael M. Maref...
EMO
2009
Springer
174views Optimization» more  EMO 2009»
15 years 4 months ago
Constraint Programming
To model combinatorial decision problems involving uncertainty and probability, we introduce stochastic constraint programming. Stochastic constraint programs contain both decision...
Pascal Van Hentenryck