3047 search results - page 141 / 610 » Randomized Parallel Selection |
95
Voted
ICSE
2007
IEEE-ACM
15 years 11 months ago
2007
IEEE-ACM
We present a technique that improves random test generation by incorporating feedback obtained from executing test inputs as they are created. Our technique builds inputs incremen...
74
Voted
SPAA
1992
ACM
15 years 3 months ago
1992
ACM
d abstract) Michael Kaufmann Sanguthevar Rajasekaran Jop F. Sibeyn In this paper we present randomized algorithms for kk routing, k-k sorting, and cut through routing on the mesh ...
88
Voted
COCOA
2008
Springer
15 years 22 days ago
2008
Springer
We consider the problem of minimizing the total weighted completion time on identical parallel machines when jobs have stochastic processing times and may arrive over time. We give...
81
Voted
CORR
2008
Springer
14 years 11 months ago
2008
Springer
One of the most fundamental problems in large-scale network analysis is to determine the importance of a particular node in a network. Betweenness centrality is the most widely us...
IPPS
2009
IEEE
15 years 5 months ago
2009
IEEE
We describe a scalable and general-purpose framework for auto-tuning compiler-generated code. We combine Active Harmony’s parallel search backend with the CHiLL compiler transfo...