Sciweavers

2805 search results - page 352 / 561
» Collecting More Garbage
Sort
View
EUROPAR
2005
Springer
16 years 10 days ago
Modeling Machine Availability in Enterprise and Wide-Area Distributed Computing Environments
In this paper, we consider the problem of modeling machine availability in enterprise-area and wide-area distributed computing settings. Using availability data gathered from three...
Daniel Nurmi, John Brevik, Richard Wolski
GECCO
2005
Springer
106views Optimization» more  GECCO 2005»
16 years 10 days ago
Fitness uniform deletion: a simple way to preserve diversity
A commonly experienced problem with population based optimisation methods is the gradual decline in population diversity that tends to occur over time. This can slow a system’s ...
Shane Legg, Marcus Hutter
ICALP
2005
Springer
16 years 10 days ago
Union-Find with Constant Time Deletions
A union-find data structure maintains a collection of disjoint sets under makeset, union and find operations. Kaplan, Shafrir and Tarjan [SODA 2002] designed data structures for ...
Stephen Alstrup, Inge Li Gørtz, Theis Rauhe...
197
Voted
IJCNLP
2005
Springer
16 years 9 days ago
Inversion Transduction Grammar Constraints for Mining Parallel Sentences from Quasi-Comparable Corpora
Abstract. We present a new implication of Wu’s (1997) Inversion Transduction Grammar (ITG) Hypothesis, on the problem of retrieving truly parallel sentence translations from larg...
Dekai Wu, Pascale Fung
ISAAC
2005
Springer
106views Algorithms» more  ISAAC 2005»
16 years 9 days ago
Generating Cut Conjunctions and Bridge Avoiding Extensions in Graphs
Let G = (V, E) be an undirected graph, and let B ⊆ V × V be a collection of vertex pairs. We give an incremental polynomial time algorithm to enumerate all minimal edge sets X ...
Leonid Khachiyan, Endre Boros, Konrad Borys, Khale...