Sciweavers

1599 search results - page 271 / 320
» Algorithms for Parity Games
Sort
View
COCO
2009
Springer
128views Algorithms» more  COCO 2009»
15 years 4 months ago
Inapproximability of Vertex Cover and Independent Set in Bounded Degree Graphs
We study the inapproximability of Vertex Cover and Independent Set on degree d graphs. We prove that: • Vertex Cover is Unique Games-hard to approximate to within a factor 2−(...
Per Austrin, Subhash Khot, Muli Safra
ISAAC
2009
Springer
114views Algorithms» more  ISAAC 2009»
15 years 4 months ago
Good Programming in Transactional Memory
Abstract. In a multicore transactional memory (TM) system, concurrent execution threads interact and interfere with each other through shared memory. The less interference a progra...
Raphael Eidenbenz, Roger Wattenhofer
SARA
2009
Springer
15 years 4 months ago
A Practical Use of Imperfect Recall
Perfect recall is the common and natural assumption that an agent never forgets. As a consequence, the agent can always condition its choice of action on any prior observations. I...
Kevin Waugh, Martin Zinkevich, Michael Johanson, M...
FDG
2009
ACM
15 years 4 months ago
System for Automated Interactive Lighting (SAIL)
Successful lighting in video games is more than a physically accurate illumination model. Aesthetics and function are of equal or greater importance. Lighting designers may deviat...
Joseph A. Zupko, Magy Seif El-Nasr
CDC
2008
IEEE
103views Control Systems» more  CDC 2008»
15 years 4 months ago
Symbolic models for nonlinear control systems affected by disturbances
Abstract— Symbolic models are abstract descriptions of continuous systems in which symbols represent aggregates of continuous states. In the last few years there has been a growi...
Giordano Pola, Paulo Tabuada