Sciweavers

1599 search results - page 312 / 320
» Algorithms for Parity Games
Sort
View
FOCS
2008
IEEE
15 years 4 months ago
Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...
Venkatesan Guruswami, Rajsekar Manokaran, Prasad R...
ATAL
2007
Springer
15 years 3 months ago
Extending character-based storytelling with awareness and feelings
Most Interactive Storytelling systems developed to date have followed a task-based approach to story representation, using planning techniques to drive the story by generating a s...
David Pizzi, Marc Cavazza, Jean-Luc Lugrin
UIST
2006
ACM
15 years 3 months ago
A direct texture placement and editing interface
The creation of most models used in computer animation and computer games requires the assignment of texture coordinates, texture painting, and texture editing. We present a novel...
Yotam I. Gingold, Philip L. Davidson, Jefferson Y....
MM
2005
ACM
118views Multimedia» more  MM 2005»
15 years 3 months ago
Supporting multi-party voice-over-IP services with peer-to-peer stream processing
Multi-party voice-over-IP (MVoIP) services provide economical and natural group communication mechanisms for many emerging applications such as on-line gaming, distance collaborat...
Xiaohui Gu, Zhen Wen, Philip S. Yu, Zon-Yin Shae
ATAL
2005
Springer
15 years 3 months ago
Improving reinforcement learning function approximators via neuroevolution
Reinforcement learning problems are commonly tackled with temporal difference methods, which use dynamic programming and statistical sampling to estimate the long-term value of ta...
Shimon Whiteson