Sciweavers

881 search results - page 39 / 177
» Solving satisfiability problems with preferences
Sort
View
GECCO
2007
Springer
171views Optimization» more  GECCO 2007»
14 years 2 months ago
Concept-based multi-objective problems and their solution by EC
Recent studies on the support of engineers during conceptual design resulted in a non-traditional type of Multi-Objective Problems (MOPs), namely concept-based ones. In concept-ba...
Amiram Moshaiov, Gideon Avigad
ECAI
2010
Springer
13 years 9 months ago
Learning When to Use Lazy Learning in Constraint Solving
Abstract. Learning in the context of constraint solving is a technique by which previously unknown constraints are uncovered during search and used to speed up subsequent search. R...
Ian P. Gent, Christopher Jefferson, Lars Kotthoff,...
STACS
2000
Springer
14 years 7 days ago
The Complexity of Poor Man's Logic
Motivated by description logics, we investigate what happens to the complexity of modal satisfiability problems if we only allow formulas built from literals, , 3, and 2. Previous...
Edith Hemaspaandra
ATAL
2001
Springer
14 years 1 months ago
Evolving Real-Time Local Agent Control for Large-Scale Multi-agent Systems
Abstract. Control for agents situated in multi-agent systems is a complex problem. This is particularly true in hard, open, dynamic environments where resource, privacy, bandwidth,...
Thomas Wagner, Victor R. Lesser
ESAW
2004
Springer
14 years 2 months ago
Welfare Engineering in Practice: On the Variety of Multiagent Resource Allocation Problems
Abstract. Many problems studied in the multiagent systems community can be considered instances of an abstract multiagent resource allocation problem. In this problem, which is now...
Yann Chevaleyre, Ulrich Endriss, Sylvia Estivie, N...