Sciweavers

3663 search results - page 611 / 733
» Problems in the ontology of computer programs
Sort
View
SAC
2010
ACM
15 years 4 months ago
Constraint-based LN-curves
We consider the design of parametric curves from geometric constraints such as distance from lines or points and tangency to lines or circles. We solve the Hermite problem with su...
Young Joon Ahn, Christoph M. Hoffmann
DATE
2009
IEEE
176views Hardware» more  DATE 2009»
15 years 4 months ago
Automated synthesis of streaming C applications to process networks in hardware
Abstract—The demand for embedded computing power is continuously increasing and FPGAs are becoming very interesting computing platforms, as they provide huge amounts of customiza...
Sven van Haastregt, Bart Kienhuis
FOCS
2009
IEEE
15 years 4 months ago
On the Power of Randomization in Algorithmic Mechanism Design
In many settings the power of truthful mechanisms is severely bounded. In this paper we use randomization to overcome this problem. In particular, we construct an FPTAS for multi-...
Shahar Dobzinski, Shaddin Dughmi
ICC
2009
IEEE
190views Communications» more  ICC 2009»
15 years 4 months ago
Decomposition for Low-Complexity Near-Optimal Routing in Multi-Hop Wireless Networks
Abstract—Network flow models serve as a popular mathematical framework for the analysis and optimization of Multi-hop Wireless Networks. They also serve to provide the understan...
Vinay Kolar, Nael B. Abu-Ghazaleh, Petri Mäh&...
EUROPAR
2009
Springer
15 years 4 months ago
Searching for Concurrent Design Patterns in Video Games
The transition to multicore architectures has dramatically underscored the necessity for parallelism in software. In particular, while new gaming consoles are by and large multicor...
Micah J. Best, Alexandra Fedorova, Ryan Dickie, An...