Sciweavers

48 search results - page 8 / 10
» A Game-Theoretic Approach for Designing Mixed Mutation Strat...
Sort
View
ICTAI
2010
IEEE
14 years 7 months ago
Continuous Search in Constraint Programming
This work presents the concept of Continuous Search (CS), which objective is to allow any user to eventually get their constraint solver achieving a top performance on their proble...
Alejandro Arbelaez, Youssef Hamadi, Michèle...
UAI
2004
14 years 11 months ago
Regret Minimizing Equilibria and Mechanisms for Games with Strict Type Uncertainty
Mechanism design has found considerable application to the construction of agent-interaction protocols. In the standard setting, the type (e.g., utility function) of an agent is n...
Nathanael Hyafil, Craig Boutilier

Publication
362views
16 years 8 months ago
A Bayesian Incentive Compatible Mechanism for Decentralized Supply Chain Formation
In this paper, we consider a decentralized supply chain formation problem for linear, multi-echelon supply chains when the managers of the individual echelons are autonomous, ratio...
Y. Narahari and Nikesh Kumar Srivastava
ISARCS
2010
240views Hardware» more  ISARCS 2010»
14 years 11 months ago
Engineering a Distributed e-Voting System Architecture: Meeting Critical Requirements
Voting is a critical component of any democratic process; and electronic voting systems should be developed following best practices for critical system development. E-voting has i...
J. Paul Gibson, Eric Lallet, Jean-Luc Raffy
CPAIOR
2010
Springer
14 years 7 months ago
Lazy Clause Generation: Combining the Power of SAT and CP (and MIP?) Solving
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
Peter J. Stuckey