Sciweavers

1071 search results - page 114 / 215
» An Experimental Study of Benchmarking Functions for Genetic ...
Sort
View
IJCAI
1993
13 years 10 months ago
Average-Case Analysis of a Nearest Neighbor Algorithm
In this paper we present an average-case analysis of the nearest neighbor algorithm, a simple induction method that has been studied by manyresearchers. Our analysis assumes a con...
Pat Langley, Wayne Iba
JEA
2008
88views more  JEA 2008»
13 years 8 months ago
Multilevel algorithms for linear ordering problems
Linear ordering problems are combinatorial optimization problems which deal with the minimization of different functionals in which the graph vertices are mapped onto (1, 2, ..., ...
Ilya Safro, Dorit Ron, Achi Brandt
IJBRA
2007
57views more  IJBRA 2007»
13 years 8 months ago
Decoding algorithms in pooling designs with inhibitors and error-tolerance
: Pooling designs are used in DNA library screening to efficiently distinguish positive from negative clones, which is fundamental for studying gene functions and many other biolog...
My T. Thai, David MacCallum, Ping Deng, Weili Wu
ICASSP
2010
IEEE
13 years 9 months ago
Convergence behavior of the Active Mask segmentation algorithm
We study the convergence behavior of the Active Mask (AM) framework, originally designed for segmenting punctate image patterns. AM combines the flexibility of traditional active...
Doru-Cristian Balcan, Gowri Srinivasa, Matthew C. ...
IWMM
2000
Springer
113views Hardware» more  IWMM 2000»
14 years 12 days ago
On the Effectiveness of GC in Java
We study the effectiveness of garbage collection (GC) algorithms by measuring the time difference between the actual collection time of an object and the potential earliest collec...
Ran Shaham, Elliot K. Kolodner, Shmuel Sagiv