Sciweavers

881 search results - page 6 / 177
» Solving satisfiability problems with preferences
Sort
View
JAL
2008
74views more  JAL 2008»
13 years 8 months ago
Solving satisfiability in the tile assembly model with a constant-size tileset
Biological systems are far more complex and robust than systems we can engineer today. One way to increase the complexity and robustness of our engineered systems is to study how ...
Yuriy Brun
JETAI
2010
115views more  JETAI 2010»
13 years 7 months ago
From soft constraints to bipolar preferences: modelling framework and solving issues
Real-life problems present several kinds of preferences. We focus on problems with both positive and negative preferences, that we call bipolar preference problems. Although seemi...
Stefano Bistarelli, Maria Silvia Pini, Francesca R...
ECAI
2000
Springer
14 years 28 days ago
Scheduling Meetings Using Distributed Valued Constraint Satisfaction Algorithm
Abstract. Scheduling meetings is generally difficult in that it attempts to satisfy the preferences of all participants. However, all participants can agree to a schedule in which...
Takuo Tsuruta, Toramatsu Shintani
IJCAI
2003
13 years 10 months ago
Propagate the Right Thing: How Preferences Can Speed-Up Constraint Solving
We present an algorithm Pref-AC that limits arc consistency (AC) to the preferred choices of a tree search procedure and that makes constraint solving more efficient without chan...
Christian Bessière, Anaïs Fabre, Ulric...
HICSS
2003
IEEE
207views Biometrics» more  HICSS 2003»
14 years 1 months ago
Multi-Agent Systems and Microeconomic Theory: A Negotiation Approach to Solve Scheduling Problems in High Dynamic Environments
Microeconomics offer a far developed theory on the subject of rational choice. This theory is applied to a multi-agent system, which has been modeled in order to establish schedul...
Hans Czap, Marc Becker