Sciweavers

1969 search results - page 163 / 394
» Financial Theory 1
Sort
View
STOC
2003
ACM
141views Algorithms» more  STOC 2003»
16 years 6 months ago
Better streaming algorithms for clustering problems
We study clustering problems in the streaming model, where the goal is to cluster a set of points by making one pass (or a few passes) over the data using a small amount of storag...
Moses Charikar, Liadan O'Callaghan, Rina Panigrahy
SODA
2010
ACM
151views Algorithms» more  SODA 2010»
16 years 3 months ago
A Max-Flow/Min-Cut Algorithm for a Class of Wireless Networks
The linear deterministic model of relay channels is a generalization of the traditional directed network model which has become popular in the study of the flow of information ove...
S. M. Sadegh Tabatabaei Yazdi, Serap A. Savari
CSL
2009
Springer
16 years 1 months ago
Model Checking FO(R) over One-Counter Processes and beyond
Abstract. One-counter processes are pushdown processes over a singleton stack alphabet (plus a stack-bottom symbol). We study the problems of model checking asynchronous products o...
Anthony Widjaja To
GECCO
2009
Springer
124views Optimization» more  GECCO 2009»
16 years 1 months ago
Three interconnected parameters for genetic algorithms
When an optimization problem is encoded using genetic algorithms, one must address issues of population size, crossover and mutation operators and probabilities, stopping criteria...
Pedro A. Diaz-Gomez, Dean F. Hougen
GECCO
2009
Springer
16 years 1 months ago
The relationship between evolvability and bloat
Bloat is a common problem with Evolutionary Algorithms (EAs) that use variable length representation. By creating unnecessarily large individuals it results in longer EA runtimes ...
Jeffrey K. Bassett, Mark Coletti, Kenneth A. De Jo...