Sciweavers

2111 search results - page 172 / 423
» Understanding the Yarowsky Algorithm
Sort
View
INFOCOM
2005
IEEE
15 years 3 months ago
Spatial-temporal analysis of passive TCP measurements
— In this paper we look at TCP data which was passively collected from an edge ISP, and analyze it to obtain some new results and deeper understanding of TCP loss process. The fo...
Eli Brosh, G. Lubetzky-Sharon, Yuval Shavitt
92
Voted
IPPS
2005
IEEE
15 years 3 months ago
High-Performance Direct Pairwise Comparison of Large Genomic Sequences
Many applications in Comparative Genomics lend themselves to implementations that take advantage of common high-performance features in modern microprocessors. However, the common...
Christopher Mueller, Mehmet M. Dalkilic, Andrew Lu...
TACAS
2005
Springer
88views Algorithms» more  TACAS 2005»
15 years 3 months ago
Shortest Counterexamples for Symbolic Model Checking of LTL with Past
Shorter counterexamples are typically easier to understand. The length of a counterexample, as reported by a model checker, depends on both the algorithm used for state space explo...
Viktor Schuppan, Armin Biere
PPSN
2004
Springer
15 years 3 months ago
A Simple Two-Module Problem to Exemplify Building-Block Assembly Under Crossover
Theoretically and empirically it is clear that a genetic algorithm with crossover will outperform a genetic algorithm without crossover in some fitness landscapes, and vice versa i...
Richard A. Watson
ATAL
2003
Springer
15 years 3 months ago
A selection-mutation model for q-learning in multi-agent systems
Although well understood in the single-agent framework, the use of traditional reinforcement learning (RL) algorithms in multi-agent systems (MAS) is not always justified. The fe...
Karl Tuyls, Katja Verbeeck, Tom Lenaerts