Sciweavers

5995 search results - page 818 / 1199
» Algorithmic Game Theory
Sort
View
ICLP
1994
Springer
15 years 11 months ago
Entailment of Finite Domain Constraints
Using a glass-box theory of finite domain constraints, FD, we show how the entailment of user-defined constraints can be expressed by antimonotone FD constraints. We also provide a...
Björn Carlson, Mats Carlsson, Daniel Diaz
POPL
1994
ACM
15 years 11 months ago
A Needed Narrowing Strategy
Abstract: The narrowing relation over terms constitutes the basis of the most important operational semantics of languages that integrate functional and logic programming paradigms...
Sergio Antoy, Rachid Echahed, Michael Hanus
SIGGRAPH
1992
ACM
15 years 10 months ago
Measuring and modeling anisotropic reflection
A new device for measuringthe spatial reflectancedistributionsof surfaces is introduced, along with a new mathematical model of sniaorropic reflectance. The reflectance model pres...
Gregory J. Ward
ACMICEC
2007
ACM
112views ECommerce» more  ACMICEC 2007»
15 years 10 months ago
An empirical study of interest-based negotiation
While argumentation-based negotiation has been accepted as a promising alternative to game-theoretic or heuristic based negotiation, no evidence has been provided to confirm this ...
Philippe Pasquier, Ramon Hollands, Frank Dignum, I...
GECCO
2010
Springer
156views Optimization» more  GECCO 2010»
15 years 10 months ago
Elementary landscape decomposition of the quadratic assignment problem
The Quadratic Assignment Problem (QAP) is a well-known NP-hard combinatorial optimization problem that is at the core of many real-world optimization problems. We prove that QAP c...
J. Francisco Chicano, Gabriel Luque, Enrique Alba