Sciweavers

1968 search results - page 57 / 394
» The Complexity of Valued Constraint Models
Sort
View
GECCO
2004
Springer
127views Optimization» more  GECCO 2004»
15 years 6 months ago
Computational Complexity and Simulation of Rare Events of Ising Spin Glasses
We discuss the computational complexity of random 2D Ising spin glasses, which represent an interesting class of constraint satisfaction problems for black box optimization. Two ex...
Martin Pelikan, Jiri Ocenasek, Simon Trebst, Matth...
AI
2006
Springer
15 years 1 months ago
Complexity of constructing solutions in the core based on synergies among coalitions
Coalition formation is a key problem in automated negotiation among self-interested agents, and other multiagent applications. A coalition of agents can sometimes accomplish thing...
Vincent Conitzer, Tuomas Sandholm
CONSTRAINTS
2004
116views more  CONSTRAINTS 2004»
15 years 1 months ago
Decision Tradeoff Using Example-Critiquing and Constraint Programming
We consider constructive preference elicitation for decision aid systems in applications such as configuration or electronic catalogs. We are particularly interested in supporting ...
Pearl Pu, Boi Faltings
JAPLL
2010
179views more  JAPLL 2010»
14 years 12 months ago
Tractable query answering and rewriting under description logic constraints
Answering queries over an incomplete database w.r.t. a set of constraints is an important computational task with applications in fields as diverse as information integration and ...
Héctor Pérez-Urbina, Boris Motik, Ia...
CP
2005
Springer
15 years 7 months ago
Applying Constraint Programming to Rigid Body Protein Docking
In this paper we show how Constraint Programming (CP) techniques can improve the efficiency and applicability of grid-based algorithms for optimising surface contact between comple...
Ludwig Krippahl, Pedro Barahona