Sciweavers

4335 search results - page 106 / 867
» Privatizing Constraint Optimization
Sort
View
CORR
2010
Springer
156views Education» more  CORR 2010»
13 years 10 months ago
The Exact Closest String Problem as a Constraint Satisfaction Problem
We report (to our knowledge) the first evaluation of Constraint Satisfaction as a computational framework for solving closest string problems. We show that careful consideration o...
Tom Kelsey, Lars Kotthoff
IAT
2008
IEEE
14 years 4 months ago
Negotiation in Semi-cooperative Agreement Problems
In this paper we introduce the Semi-Cooperative Extended Incremental Multiagent Agreement Problem with Preferences (SC-EIMAPP). In SC-EIMAPPs, variables arise over time. For each ...
Elisabeth Crawford, Manuela M. Veloso
SIGECOM
2004
ACM
134views ECommerce» more  SIGECOM 2004»
14 years 3 months ago
Computing approximate bayes-nash equilibria in tree-games of incomplete information
We provide efficient algorithms for finding approximate BayesNash equilibria (BNE) in graphical, specifically tree, games of incomplete information. In such games an agent’s p...
Satinder P. Singh, Vishal Soni, Michael P. Wellman
AIPS
2003
13 years 11 months ago
Economically Augmented Job Shop Scheduling
We present economically augmented job shop scheduling (EJSP) as an example of a coordination problem among selfinterested agents with private information. We discuss its signific...
Wolfram Conen
DEXA
2004
Springer
131views Database» more  DEXA 2004»
14 years 3 months ago
Partially Ordered Preferences Applied to the Site Location Problem in Urban Planning
Abstract. This paper presents an application that aims at identifying optimal locations based on partially ordered constraints. It combines a tool developed in this project that al...
Sylvain Lagrue, Rodolphe Devillers, Jean-Yves Besq...