Sciweavers

16257 search results - page 74 / 3252
» D-finiteness: algorithms and applications
Sort
View
INFOCOM
2012
IEEE
11 years 11 months ago
On the construction of data aggregation tree with minimum energy cost in wireless sensor networks: NP-completeness and approxima
—In many applications, it is a basic operation for the sink to periodically collect reports from all sensors. Since the data gathering process usually proceeds for many rounds, i...
Tung-Wei Kuo, Ming-Jer Tsai
ECRTS
2009
IEEE
13 years 6 months ago
On-Line Scheduling Algorithm for the Gravitational Task Model
Some applications for real-time scheduling have target demands in addition to the commonly used starttime and deadline constraints: a task should be executed at a target point in ...
Raphael Guerra, Gerhard Fohler
ERSA
2009
149views Hardware» more  ERSA 2009»
13 years 6 months ago
Hardware-Optimized Ziggurat Algorithm for High-Speed Gaussian Random Number Generators
Many scientific and engineering applications, which are increasingly being ported from software to reconfigurable platforms, require Gaussian-distributed random numbers. Thus, the...
Hassan Edrees, Brian Cheung, McCullen Sandora, Dav...
HIPC
2009
Springer
13 years 6 months ago
Detailed analysis of I/O traces for large scale applications
- In this paper, we present a tool to extract I/O traces from very large applications running at full scale during their production runs. We analyze these traces to gain informatio...
Nithin Nakka, Alok N. Choudhary, Wei-keng Liao, Le...
WG
2010
Springer
13 years 6 months ago
Efficient Algorithms for Eulerian Extension
Eulerian extension problems aim at making a given (directed) (multi-)graph Eulerian by adding a minimum-cost set of edges (arcs). These problems have natural applications in schedu...
Frederic Dorn, Hannes Moser, Rolf Niedermeier, Mat...