Sciweavers

210 search results - page 13 / 42
» Some Competition Programming Problems as the Beginning of Ar...
Sort
View
CSCLP
2004
Springer
15 years 2 months ago
Automatically Exploiting Symmetries in Constraint Programming
We introduce a framework for studying and solving a class of CSP formulations. The framework allows constraints to be expressed as linear and nonlinear equations, then compiles th...
Arathi Ramani, Igor L. Markov
CEC
2010
IEEE
14 years 9 months ago
Genetic programming for Expert Systems
— Genetic programming is the usage of the paradigm of survival of the fittest in scientific computing. It is applied to evolve solutions to problems where dependencies between ...
Konrad Sickel, Joachim Hornegger
ATAL
2010
Springer
14 years 10 months ago
Strategy-proof allocation of multiple items between two agents without payments or priors
We investigate the problem of allocating items (private goods) among competing agents in a setting that is both prior-free and paymentfree. Specifically, we focus on allocating mu...
Mingyu Guo, Vincent Conitzer
118
Voted
AMAI
1999
Springer
14 years 9 months ago
Logic Programs with Stable Model Semantics as a Constraint Programming Paradigm
Logic programming with the stable model semantics is put forward as a novel constraint programming paradigm. This paradigm is interesting because it bring advantages of logic prog...
Ilkka Niemelä
CP
2007
Springer
15 years 3 months ago
Uncertainty in Bipolar Preference Problems
Preferences and uncertainty are common in many real-life problems. In this paper, we focus on bipolar preferences and on uncertainty modelled via uncontrollable variables. However,...
Stefano Bistarelli, Maria Silvia Pini, Francesca R...