Sciweavers

597 search results - page 24 / 120
» Dominating Distributions and Learnability
Sort
View
COLT
1992
Springer
15 years 9 months ago
Language Learning from Stochastic Input
Language learning from positive data in the Gold model of inductive inference is investigated in a setting where the data can be modeled as a stochastic process. Specifically, the...
Shyam Kapur, Gianfranco Bilardi
TCS
2008
15 years 4 months ago
Comparing evolutionary algorithms to the (1+1)-EA
In this paper, we study the conditions in which the (1+1)-EA compares favorably to other evolutionary algorithms (EAs) in terms of fitness function distribution at given iteration...
Pavel A. Borisovsky, Anton V. Eremeev
CCR
2002
133views more  CCR 2002»
15 years 4 months ago
Crossover scaling effects in aggregated TCP traffic with congestion losses
We critically examine the claims that TCP congestion control contributes to the observed self-similar traffic rate correlations. A simulation model is designed to analyze aggregat...
Michael Liljenstam, Andrew T. Ogielski
IAT
2005
IEEE
15 years 10 months ago
Optimizing Agents Operation in Partially Inaccessible and Disruptive Environment
The algorithm we present in this paper aims to optimally distribute and connect the community of loosely coupled middle agents ensuring communication accessibility in a dynamic, i...
David Sislák, Martin Rehák, Michal P...
159
Voted
PODC
2010
ACM
15 years 7 months ago
Brief announcement: efficient graph algorithms without synchronization
We give a graph decomposition technique that creates entirely independent subproblems for graph problems such as coloring and dominating sets that can be solved without synchroniz...
Johannes Schneider, Roger Wattenhofer