Sciweavers

800 search results - page 149 / 160
» On the Complexity of Parity Games
Sort
View
HIPC
2007
Springer
14 years 3 months ago
FFTC: Fastest Fourier Transform for the IBM Cell Broadband Engine
The Fast Fourier Transform (FFT) is of primary importance and a fundamental kernel in many computationally intensive scientific applications. In this paper we investigate its perf...
David A. Bader, Virat Agarwal
DAC
2006
ACM
13 years 11 months ago
A fast HW/SW FPGA-based thermal emulation framework for multi-processor system-on-chip
With the growing complexity in consumer embedded products and the improvements in process technology, Multi-Processor SystemOn-Chip (MPSoC) architectures have become widespread. T...
David Atienza, Pablo Garcia Del Valle, Giacomo Pac...
CGF
2011
13 years 17 days ago
Procedural Modeling of Interconnected Structures
The complexity and detail of geometric scenes that are used in today’s computer animated films and interactive games have reached a level where the manual creation by tradition...
Lars Krecklau, Leif Kobbelt
SODA
2010
ACM
190views Algorithms» more  SODA 2010»
14 years 6 months ago
One-Counter Markov Decision Processes
We study the computational complexity of some central analysis problems for One-Counter Markov Decision Processes (OC-MDPs), a class of finitely-presented, countable-state MDPs. O...
Tomas Brazdil, Vaclav Brozek, Kousha Etessami, Ant...
PLDI
2009
ACM
14 years 3 months ago
Stretching transactional memory
Transactional memory (TM) is an appealing abstraction for programming multi-core systems. Potential target applications for TM, such as business software and video games, are like...
Aleksandar Dragojevic, Rachid Guerraoui, Michal Ka...