Sciweavers

3446 search results - page 144 / 690
» A Reasoning Algorithm for pD*
Sort
View
PPOPP
2009
ACM
16 years 4 months ago
An efficient transactional memory algorithm for computing minimum spanning forest of sparse graphs
Due to power wall, memory wall, and ILP wall, we are facing the end of ever increasing single-threaded performance. For this reason, multicore and manycore processors are arising ...
Seunghwa Kang, David A. Bader
ICSM
2005
IEEE
15 years 9 months ago
Comparison of Clustering Algorithms in the Context of Software Evolution
To aid software analysis and maintenance tasks, a number of software clustering algorithms have been proposed to automatically partition a software system into meaningful subsyste...
Jingwei Wu, Ahmed E. Hassan, Richard C. Holt
SODA
2010
ACM
397views Algorithms» more  SODA 2010»
16 years 1 months ago
Improved Approximation Algorithms for the Minimum Latency Problem via Prize-Collecting Strolls
The minimum latency problem (MLP) is a well-studied variant of the traveling salesman problem (TSP). In the MLP, the server's goal is to minimize the average latency that the...
Aaron Archer, Anna Blasiak
STOC
1997
ACM
125views Algorithms» more  STOC 1997»
15 years 8 months ago
An Interruptible Algorithm for Perfect Sampling via Markov Chains
For a large class of examples arising in statistical physics known as attractive spin systems (e.g., the Ising model), one seeks to sample from a probability distribution π on an...
James Allen Fill
CORR
2010
Springer
125views Education» more  CORR 2010»
15 years 4 months ago
Critical control of a genetic algorithm
Based on speculations coming from statistical mechanics and the conjectured existence of critical states, I propose a simple heuristic in order to control the mutation probability...
Raphaël Cerf