Sciweavers

3047 search results - page 487 / 610
» Randomized Parallel Selection
Sort
View
WEA
2005
Springer
119views Algorithms» more  WEA 2005»
15 years 8 months ago
On Symbolic Scheduling Independent Tasks with Restricted Execution Times
Ordered Binary Decision Diagrams (OBDDs) are a data structure for Boolean functions which supports many useful operations. It finds applications in CAD, model checking, and symbol...
Daniel Sawitzki
ASPDAC
2004
ACM
109views Hardware» more  ASPDAC 2004»
15 years 8 months ago
Design methodology for IRA codes
Channel coding is an important building block in communication systems since it ensures the quality of service. Irregular repeat-accumulate (IRA) codes belong to the class of Low-...
Frank Kienle, Norbert Wehn
126
Voted
ESA
2004
Springer
127views Algorithms» more  ESA 2004»
15 years 8 months ago
Load Balancing of Indivisible Unit Size Tokens in Dynamic and Heterogeneous Networks
The task of balancing dynamically generated work load occurs in a wide range of parallel and distributed applications. Diffusion based schemes, which belong to the class of nearest...
Robert Elsässer, Burkhard Monien, Stefan Scha...
107
Voted
WEA
2004
Springer
124views Algorithms» more  WEA 2004»
15 years 8 months ago
Experimental Studies of Symbolic Shortest-Path Algorithms
Abstract. Graphs can be represented symbolically by the Ordered Binary Decision Diagram (OBDD) of their characteristic function. To solve problems in such implicitly given graphs, ...
Daniel Sawitzki
108
Voted
CCGRID
2003
IEEE
15 years 7 months ago
Supporting Peer-to-Peer Computing with FlexiNet
Formation of suitable overlay-network topologies that are able to reflect the structure of the underlying network-infrastructure, has rarely been addressed by peer-to-peer applic...
Thomas Fuhrmann