Sciweavers

2542 search results - page 465 / 509
» Computing Cartograms with Optimal Complexity
Sort
View
INFOCOM
2006
IEEE
14 years 2 months ago
Stable Scheduling Policies for Maximizing Throughput in Generalized Constrained Queueing Systems
We consider a class of queueing networks referred to as “generalized constrained queueing networks” which form the basis of several different communication networks and inform...
Prasanna Chaporkar, Saswati Sarkar
MEMOCODE
2006
IEEE
14 years 2 months ago
Latency-insensitive design and central repetitive scheduling
The theory of latency-insensitive design (LID) was recently invented to cope with the time closure problem in otherwise synchronous circuits and programs. The idea is to allow the...
Julien Boucaron, Robert de Simone, Jean-Vivien Mil...
GECCO
2005
Springer
140views Optimization» more  GECCO 2005»
14 years 2 months ago
CGP visits the Santa Fe trail: effects of heuristics on GP
GP uses trees to represent chromosomes. The user defines the representation space by defining the set of functions and terminals to label the nodes in the trees, and GP searches t...
Cezary Z. Janikow, Christopher J. Mann
GECCO
2005
Springer
141views Optimization» more  GECCO 2005»
14 years 2 months ago
Constructing good learners using evolved pattern generators
Self-organization of brain areas in animals begins prenatally, evidently driven by spontaneously generated internal patterns. The neural structures continue to develop postnatally...
Vinod K. Valsalam, James A. Bednar, Risto Miikkula...
LATIN
1998
Springer
14 years 1 months ago
Fast Two-Dimensional Approximate Pattern Matching
We address the problem of approximate string matching in two dimensions, that is, to nd a pattern of size m m in a text of size n n with at most k errors (substitutions, insertions...
Ricardo A. Baeza-Yates, Gonzalo Navarro