Sciweavers

1146 search results - page 167 / 230
» Finite cupping sets
Sort
View
UAI
2004
13 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
ACL
1990
13 years 11 months ago
Deterministic Left to Right Parsing of Tree Adjoining Languages
We define a set of deterministic bottom-up left to right parsers which analyze a subset of Tree Adjoining Languages. The LR parsing strategy for Context Free Grammars is extended ...
Yves Schabes, K. Vijay-Shanker
ATAL
2010
Springer
13 years 11 months ago
Reasoning about strategies of multi-agent programs
Verification of multi-agent programs is a key problem in agent research and development. This paper focuses on multi-agent programs that consist of a finite set of BDI-based agent...
Mehdi Dastani, Wojciech Jamroga
AUTOMATICA
2008
116views more  AUTOMATICA 2008»
13 years 10 months ago
A dynamical systems approach to weighted graph matching
Graph matching is a fundamental problem that arises frequently in the areas of distributed control, computer vision, and facility allocation. In this paper, we consider the optimal...
Michael M. Zavlanos, George J. Pappas
EOR
2010
178views more  EOR 2010»
13 years 10 months ago
Facility location problems in the plane based on reverse nearest neighbor queries
For a finite set of points S, the (monochromatic) Reverse Nearest Neighbor (RNN) rule associates with any query point q the subset of points in S that have q as its nearest neighb...
Sergio Cabello, José Miguel Díaz-B&a...