Sciweavers

942 search results - page 127 / 189
» Cooperating Constraint Solvers
Sort
View
AAAI
2008
15 years 4 days ago
A Reductive Semantics for Counting and Choice in Answer Set Programming
In a recent paper, Ferraris, Lee and Lifschitz conjectured that the concept of a stable model of a first-order formula can be used to treat some answer set programming expressions...
Joohyung Lee, Vladimir Lifschitz, Ravi Palla
AIIDE
2006
14 years 11 months ago
Lightweight Simulation of Air Traffic Control Using Simple Temporal Networks
Flight simulators are becoming more sophisticated and realistic, and the requirements of those using them are becoming more demanding. Air traffic control simulation for such simu...
Russell Knight
CP
2010
Springer
14 years 8 months ago
Local Consistency and SAT-Solvers
In this paper we show that the power of using k-consistency techniques in a constraint problem is precisely captured by using a particular inference rule, which we call positive-hy...
Justyna Petke, Peter Jeavons
IVA
2010
Springer
14 years 8 months ago
Realizing Multimodal Behavior - Closing the Gap between Behavior Planning and Embodied Agent Presentation
Abstract. Generating coordinated multimodal behavior for an embodied agent (speech, gesture, facial expression. . . ) is challenging. It requires a high degree of animation control...
Michael Kipp, Alexis Heloir, Marc Schröder, P...
SAGT
2010
Springer
200views Game Theory» more  SAGT 2010»
14 years 8 months ago
2-Player Nash and Nonsymmetric Bargaining Games: Algorithms and Structural Properties
The solution to a Nash or a nonsymmetric bargaining game is obtained by maximizing a concave function over a convex set, i.e., it is the solution to a convex program. We show that...
Vijay V. Vazirani