1612 search results - page 82 / 323 » Analysing Randomized Distributed Algorithms |
108
click to vote
EUROPAR
2008
Springer
15 years 6 months ago
2008
Springer
This paper presents provable work-optimal parallelizations of STL (Standard Template Library) algorithms based on the workstealing technique. Unlike previous approaches where a deq...
139
click to vote
HCW
1998
IEEE
15 years 9 months ago
1998
IEEE
With the advent of large scale heterogeneous environments, there is a need for matching and scheduling algorithms which can allow multiple DAG-structured applications to share the...
111
Voted
WDAG
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. Wireless ad-hoc networks are being increasingly used in diverse contexts, ranging from casual meetings to disaster recovery operations. A promising approach is to model t...
142
click to vote
GECCO
2007
Springer
15 years 11 months ago
2007
Springer
Generating a random sampling of program trees with specified function and terminal sets is the initial step of many program evolution systems. I present a theoretical and experim...
171
Voted
VLSM
2005
Springer
15 years 10 months ago
2005
Springer
We present a computationally efficient segmentationrestoration method, based on a probabilistic formulation, for the joint estimation of the label map (segmentation) and the para...