800 search results - page 97 / 160 » On the Complexity of Parity Games |
ATAL
2009
Springer
13 years 7 months ago
2009
Springer
Today's society is largely connected and many real life applications lend themselves to be modeled as multi-agent systems. Although such systems as well as their models are d...
DAC
2009
ACM
14 years 10 months ago
2009
ACM
Electronic design automation is a field replete with challenging ? and often intractable ? problems to be solved over very large instances. As a result, the field of design automa...
FSTTCS
2007
Springer
14 years 3 months ago
2007
Springer
Entanglement is a complexity measure of directed graphs that origins in fixed point theory. This measure has shown its use in designing efficient algorithms to verify logical prop...
IWEC
2004
13 years 10 months ago
2004
Procedural techniques will soon automate many aspects of content creation for computer games. We describe an efficient, deterministic, methodology for procedurally generating 3D ga...
PPOPP
2009
ACM
14 years 9 months ago
2009
ACM
Transactional Memory (TM) is being studied widely as a new technique for synchronizing concurrent accesses to shared memory data structures for use in multi-core systems. Much of ...