Sciweavers

7978 search results - page 752 / 1596
» Combining shared-coin algorithms
Sort
View
GECCO
2005
Springer
153views Optimization» more  GECCO 2005»
16 years 1 months ago
Evolving neural network ensembles for control problems
In neuroevolution, a genetic algorithm is used to evolve a neural network to perform a particular task. The standard approach is to evolve a population over a number of generation...
David Pardoe, Michael S. Ryoo, Risto Miikkulainen
MDM
2005
Springer
174views Communications» more  MDM 2005»
16 years 1 months ago
GPAC: generic and progressive processing of mobile queries over mobile data
This paper introduces a new family of Generic and Progressive algorithms (GPAC, for short) for continuous mobile queries over mobile objects. GPAC provides a general skeleton that...
Mohamed F. Mokbel, Walid G. Aref
APPROX
2004
Springer
179views Algorithms» more  APPROX 2004»
16 years 27 days ago
Maximum Weight Independent Sets and Matchings in Sparse Random Graphs. Exact Results Using the Local Weak Convergence Method
ABSTRACT: Let G(n, c/n) and Gr(n) be an n-node sparse random graph and a sparse random rregular graph, respectively, and let I(n, r) and I(n, c) be the sizes of the largest indepen...
David Gamarnik, Tomasz Nowicki, Grzegorz Swirszcz
CC
2004
Springer
16 years 27 days ago
Using Multiple Memory Access Instructions for Reducing Code Size
An important issue in embedded systems design is the size of programs. As computing devices decrease in size, yet with more and more functions, better code size optimizations are i...
Neil Johnson, Alan Mycroft
ICCSA
2004
Springer
16 years 26 days ago
New Parameter for Balancing Two Independent Measures in Routing Path
The end-to-end characteristic is an important factor for QoS support. Since network users and their required bandwidths for applications increase, the efficient usage of networks h...
Moonseong Kim, Young-Cheol Bang, Hyunseung Choo