Sciweavers

1186 search results - page 103 / 238
» Improving Random Walk Performance
Sort
View
EVOW
2008
Springer
15 years 4 months ago
Reactive Stochastic Local Search Algorithms for the Genomic Median Problem
Abstract. The genomic median problem is an optimization problem inspired by a biological issue: it aims at finding the chromosome organization of the common ancestor to multiple li...
Renaud Lenne, Christine Solnon, Thomas Stützl...
FOCS
2002
IEEE
15 years 7 months ago
Load Balancing with Memory
A standard load balancing model considers placing Ò balls into Ò bins by choosing possible locations for each ball independently and uniformly at random and sequentially placing...
Michael Mitzenmacher, Balaji Prabhakar, Devavrat S...
139
Voted
ESEM
2007
ACM
15 years 6 months ago
The Effects of Over and Under Sampling on Fault-prone Module Detection
The goal of this paper is to improve the prediction performance of fault-prone module prediction models (fault-proneness models) by employing over/under sampling methods, which ar...
Yasutaka Kamei, Akito Monden, Shinsuke Matsumoto, ...
WADS
1989
Springer
84views Algorithms» more  WADS 1989»
15 years 6 months ago
Skip Lists: A Probabilistic Alternative to Balanced Trees
rees can be used for representing abstract data types such as dictionaries and ordered lists. They work well when the elements are inserted in a random order. Some sequences of ope...
William Pugh
ICDM
2008
IEEE
137views Data Mining» more  ICDM 2008»
15 years 9 months ago
Iterative Set Expansion of Named Entities Using the Web
Set expansion refers to expanding a partial set of “seed” objects into a more complete set. One system that does set expansion is SEAL (Set Expander for Any Language), which e...
Richard C. Wang, William W. Cohen