Sciweavers

800 search results - page 146 / 160
» On the Complexity of Parity Games
Sort
View
AAAI
2006
13 years 10 months ago
Algorithms for Rationalizability and CURB Sets
Significant work has been done on computational aspects of solving games under various solution concepts, such as Nash equilibrium, subgame perfect Nash equilibrium, correlated eq...
Michael Benisch, George B. Davis, Tuomas Sandholm
IWEC
2004
13 years 10 months ago
New Behavioural Approaches for Virtual Environments
We describe a new approach to the behaviour of 3D environments that supports the definition of physical processes and interactive phenomena. The work takes as a starting point the ...
Marc Cavazza, Simon Hartley, Jean-Luc Lugrin, Paol...
VMV
2003
151views Visualization» more  VMV 2003»
13 years 10 months ago
Optimized Spatial Hashing for Collision Detection of Deformable Objects
We propose a new approach to collision and self– collision detection of dynamically deforming objects that consist of tetrahedrons. Tetrahedral meshes are commonly used to repre...
Matthias Teschner, Bruno Heidelberger, Matthias M&...
ATVA
2010
Springer
148views Hardware» more  ATVA 2010»
13 years 10 months ago
Recursive Timed Automata
We study recursive timed automata that extend timed automata with recursion. Timed automata, as introduced by Alur and Dill, are finite automata accompanied by a finite set of real...
Ashutosh Trivedi, Dominik Wojtczak
CCGRID
2009
IEEE
13 years 10 months ago
Efficient Grid Task-Bundle Allocation Using Bargaining Based Self-Adaptive Auction
To address coordination and complexity issues, we formulate a grid task allocation problem as a bargaining based self-adaptive auction and propose the BarSAA grid task-bundle alloc...
Han Zhao, Xiaolin Li