Sciweavers

1568 search results - page 50 / 314
» The problem of examination questions in algorithmics
Sort
View
CASCON
1996
89views Education» more  CASCON 1996»
14 years 11 months ago
A comparison of algorithms for interprocedural class analysis
Message passing overhead is often a substantial source of runtime overhead in object-oriented applications. To combat this performance problem, a number of techniques have been de...
David Grove
ICML
2003
IEEE
15 years 11 months ago
Online Choice of Active Learning Algorithms
This paper is concerned with the question of how to online combine an ensemble of active learners so as to expedite the learning progress during a pool-based active learning sessi...
Yoram Baram, Ran El-Yaniv, Kobi Luz
62
Voted
GECCO
2006
Springer
161views Optimization» more  GECCO 2006»
15 years 1 months ago
Instance similarity and the effectiveness of case injection in a genetic algorithm for binary quadratic programming
When an evolutionary algorithm addresses a sequence of instances of the same problem, it can seed its population with solutions that it found for previous instances. This techniqu...
Jason Amunrud, Bryant A. Julstrom
PODC
1999
ACM
15 years 2 months ago
Analysis of Timing-Based Mutual Exclusion with Random Times
Various timing-based mutualexclusion algorithms have been proposed that guarantee mutual exclusion if certain timing assumptions hold. In this paper, we examine how these algorith...
Eli Gafni, Michael Mitzenmacher
STOC
1992
ACM
100views Algorithms» more  STOC 1992»
15 years 2 months ago
Biased Random Walks
How much can an imperfect source of randomness affect an algorithm? We examine several simple questions of this type concerning the long-term behavior of a random walk on a finite...
Yossi Azar, Andrei Z. Broder, Anna R. Karlin, Nath...