Sciweavers

7228 search results - page 461 / 1446
» From Algorithmic to Subjective Randomness
Sort
View
PPSN
2004
Springer
16 years 5 days ago
A Visual Demonstration of Convergence Properties of Cooperative Coevolution
Abstract. We introduce a model for cooperative coevolutionary algorithms (CCEAs) using partial mixing, which allows us to compute the expected long-run convergence of such algorith...
Liviu Panait, R. Paul Wiegand, Sean Luke
ICDAR
1997
IEEE
15 years 11 months ago
UW-ISL Document Image Analysis Toolbox: An Experimental Environment
A document image analysis toolbox, including a collection of data structures and algorithms to suppbrt a variety of applications, is described in this paper. An experimental envir...
Jisheng Liang, Richard Rogers, Robert M. Haralick,...
UAI
2003
15 years 8 months ago
On Local Optima in Learning Bayesian Networks
This paper proposes and evaluates the k-greedy equivalence search algorithm (KES) for learning Bayesian networks (BNs) from complete data. The main characteristic of KES is that i...
Jens D. Nielsen, Tomás Kocka, José M...
CACM
2008
53views more  CACM 2008»
15 years 7 months ago
Distributed selection: a missing piece of data aggregation
In this article, we study the problem of distributed selection from a theoretical point of view. Given a general connected graph of diameter D consisting of n nodes in which each ...
Fabian Kuhn, Thomas Locher, Roger Wattenhofer
188
Voted
AAECC
2005
Springer
131views Algorithms» more  AAECC 2005»
15 years 6 months ago
Noisy interpolation of sparse polynomials in finite fields
Abstract We consider a polynomial analogue of the hidden number problem introduced by Boneh andVenkatesan, namely the sparse polynomial noisy interpolation problem of recovering an...
Igor Shparlinski, Arne Winterhof