Sciweavers

239 search results - page 10 / 48
» Dynamic Response Time Optimization for SDF Graphs
Sort
View
AI
2006
Springer
13 years 11 months ago
Exploiting Dynamic Independence in a Static Conditioning Graph
Abstract. A conditioning graph (CG) is a graphical structure that attempt to minimize the implementation overhead of computing probabilities in belief networks. A conditioning grap...
Kevin Grant, Michael C. Horsch
MUE
2008
IEEE
103views Multimedia» more  MUE 2008»
14 years 1 months ago
Ubiquitous Web Access: Collaborative Optimization and Dynamic Content Negotiation
Traditionally, cellular wide area networks like UMTS are used as Internet access networks for particular users but, in some cases, they can be employed to provide Internet access ...
Xavier Sanchez-Loro, Victoria Beltran, Jordi Casad...
IPPS
2010
IEEE
13 years 5 months ago
Executing task graphs using work-stealing
Abstract--NABBIT is a work-stealing library for execution of task graphs with arbitrary dependencies which is implemented as a library for the multithreaded programming language Ci...
Kunal Agrawal, Charles E. Leiserson, Jim Sukha
EENERGY
2010
13 years 11 months ago
Optimal sleep patterns for serving delay-tolerant jobs
Sleeping is an important method to reduce energy consumption in many information and communication systems. In this paper we focus on a typical server under dynamic load, where en...
Ioannis Kamitsos, Lachlan L. H. Andrew, Hongseok K...
ISCAS
1999
IEEE
132views Hardware» more  ISCAS 1999»
13 years 11 months ago
Dynamic trellis diagrams for optimized DSP code generation
In this paper, we present the application of dynamic trellis diagrams (DTDs) to automatic translation of data flow graphs (DFGs) into highly optimized programs for digital signal ...
Stefan Fröhlich, Martin Gotschlich, Udo Krebe...