Sciweavers

2917 search results - page 55 / 584
» Satisfying Interaction Constraints
Sort
View
AAAI
2006
13 years 10 months ago
On the Difficulty of Achieving Equilibrium in Interactive POMDPs
We analyze the asymptotic behavior of agents engaged in an infinite horizon partially observable stochastic game as formalized by the interactive POMDP framework. We show that whe...
Prashant Doshi, Piotr J. Gmytrasiewicz
STOC
2006
ACM
132views Algorithms» more  STOC 2006»
14 years 9 months ago
Near-optimal algorithms for unique games
Unique games are constraint satisfaction problems that can be viewed as a generalization of Max-Cut to a larger domain size. The Unique Games Conjecture states that it is hard to ...
Moses Charikar, Konstantin Makarychev, Yury Makary...
CAV
2009
Springer
206views Hardware» more  CAV 2009»
14 years 9 months ago
D-Finder: A Tool for Compositional Deadlock Detection and Verification
D-Finder tool implements a compositional method for the verification of component-based systems described in BIP language encompassing multi-party interaction. For deadlock detecti...
Saddek Bensalem, Marius Bozga, Thanh-Hung Nguyen, ...
CONSTRAINTS
2006
120views more  CONSTRAINTS 2006»
13 years 8 months ago
Constraint Models for the Covering Test Problem
Covering arrays can be applied to the testing of software, hardware and advanced materials, and to the effects of hormone interaction on gene expression. In this paper we develop c...
Brahim Hnich, Steven David Prestwich, Evgeny Selen...
3DPVT
2006
IEEE
216views Visualization» more  3DPVT 2006»
14 years 17 days ago
Object Modeling with Guaranteed Fulfillment of Geometric Constraints
Object modeling under consideration of geometric constraints is an important task. In this paper we describe a novel approach to achieving this goal. It has the nice property that...
Da-Chuan Cheng, Xiaoyi Jiang