Sciweavers

543 search results - page 14 / 109
» A Randomized Parallel Sorting Algorithm with an Experimental...
Sort
View
EXPCS
2007
13 years 11 months ago
EXACT: the experimental algorithmics computational toolkit
In this paper, we introduce EXACT, the EXperimental Algorithmics Computational Toolkit. EXACT is a software framework for describing, controlling, and analyzing computer experimen...
William E. Hart, Jonathan W. Berry, Robert T. Heap...
COMPGEOM
2009
ACM
14 years 2 months ago
Parallel geometric algorithms for multi-core computers
Computers with multiple processor cores using shared memory are now ubiquitous. In this paper, we present several parallel geometric algorithms that specifically target this envi...
Vicente H. F. Batista, David L. Millman, Sylvain P...
JSAT
2008
122views more  JSAT 2008»
13 years 7 months ago
SAT Algorithms for Colouring Some Special Classes of Graphs: Some Theoretical and Experimental Results
The local search algorithm GSAT is based on the notion of Satisfiability. It has been used successfully for colouring graphs, solving instances of the 3SAT problem, planning block...
Sriyankar Acharyya
HEURISTICS
2002
65views more  HEURISTICS 2002»
13 years 7 months ago
Probability Distribution of Solution Time in GRASP: An Experimental Investigation
A GRASP (greedy randomized adaptive search procedure) is a multi-start metaheuristic for combinatorial optimization. We study the probability distributions of solution time to a su...
Renata M. Aiex, Mauricio G. C. Resende, Celso C. R...
JPDC
2008
129views more  JPDC 2008»
13 years 7 months ago
A framework for scalable greedy coloring on distributed-memory parallel computers
We present a scalable framework for parallelizing greedy graph coloring algorithms on distributed-memory computers. The framework unifies several existing algorithms and blends a ...
Doruk Bozdag, Assefaw Hadish Gebremedhin, Fredrik ...