Sciweavers

1717 search results - page 99 / 344
» On the analysis of the (1 1) memetic algorithm
Sort
View
CORR
2008
Springer
85views Education» more  CORR 2008»
15 years 6 months ago
Online Scheduling to Minimize the Maximum Delay Factor
In this paper two scheduling models are addressed. First is the standard model (unicast) where requests (or jobs) are independent. The other is the broadcast model where broadcast...
Chandra Chekuri, Benjamin Moseley
IJCNN
2006
IEEE
16 years 12 days ago
Optimal In-Place Learning and the Lobe Component Analysis
— It is difficult to map many existing learning algorithms onto biological networks because the former require a separate learning network. The computational basis of biological...
Juyang Weng, Nan Zhang 0002
ALGORITHMICA
2010
106views more  ALGORITHMICA 2010»
15 years 6 months ago
Analysis of the Expected Number of Bit Comparisons Required by Quickselect
When algorithms for sorting and searching are applied to keys that are represented as bit strings, we can quantify the performance of the algorithms not only in terms of the numbe...
James Allen Fill, Takéhiko Nakama
CORR
2010
Springer
125views Education» more  CORR 2010»
15 years 6 months ago
Critical control of a genetic algorithm
Based on speculations coming from statistical mechanics and the conjectured existence of critical states, I propose a simple heuristic in order to control the mutation probability...
Raphaël Cerf
SIGMOD
2008
ACM
140views Database» more  SIGMOD 2008»
15 years 6 months ago
Near-optimal algorithms for shared filter evaluation in data stream systems
We consider the problem of evaluating multiple overlapping queries defined on data streams, where each query is a conjunction of multiple filters and each filter may be shared acr...
Zhen Liu, Srinivasan Parthasarathy 0002, Anand Ran...