Sciweavers

12194 search results - page 2097 / 2439
» Numberings Optimal for Learning
Sort
View
COCOON
2003
Springer
16 years 19 hour ago
Finding Hidden Independent Sets in Interval Graphs
We design efficient competitive algorithms for discovering hidden information using few queries. Specifically, consider a game in a given set of intervals (and their implied inte...
Therese C. Biedl, Brona Brejová, Erik D. De...
CRYPTO
2003
Springer
187views Cryptology» more  CRYPTO 2003»
16 years 18 hour ago
On Constructing Locally Computable Extractors and Cryptosystems in the Bounded Storage Model
We consider the problem of constructing randomness extractors that are locally computable; that is, read only a small number of bits from their input. As recently shown by Lu (thi...
Salil P. Vadhan
GECCO
2003
Springer
100views Optimization» more  GECCO 2003»
16 years 9 hour ago
Studying the Advantages of a Messy Evolutionary Algorithm for Natural Language Tagging
The process of labeling each word in a sentence with one of its lexical categories (noun, verb, etc) is called tagging and is a key step in parsing and many other language processi...
Lourdes Araujo
GECCO
2003
Springer
283views Optimization» more  GECCO 2003»
16 years 9 hour ago
A Game-Theoretic Memory Mechanism for Coevolution
One problem associated with coevolutionary algorithms is that of forgetting, where one or more previously acquired traits are lost only to be needed later. We introduce a new coevo...
Sevan G. Ficici, Jordan B. Pollack
GECCO
2003
Springer
182views Optimization» more  GECCO 2003»
16 years 8 hour ago
Modeling the Search Landscape of Metaheuristic Software Clustering Algorithms
Abstract. Software clustering techniques are useful for extracting architectural information about a system directly from its source code structure. This paper starts by examining ...
Brian S. Mitchell, Spiros Mancoridis
« Prev « First page 2097 / 2439 Last » Next »