Sciweavers

315 search results - page 53 / 63
» Are Multiple Runs of Genetic Algorithms Better than One
Sort
View
GLVLSI
2010
IEEE
164views VLSI» more  GLVLSI 2010»
14 years 3 months ago
Performance and energy trade-offs analysis of L2 on-chip cache architectures for embedded MPSoCs
On-chip memory organization is one of the most important aspects that can influence the overall system behavior in multiprocessor systems. Following the trend set by high-perform...
Mohamed M. Sabry, Martino Ruggiero, Pablo Garcia D...
INFFUS
2008
175views more  INFFUS 2008»
13 years 10 months ago
Adaptive optimization of join trees for multi-join queries over sensor streams
Data processing applications for sensor streams have to deal with multiple continuous data streams with inputs arriving at highly variable and unpredictable rates from various sour...
Joseph S. Gomes, Hyeong-Ah Choi
AICCSA
2007
IEEE
124views Hardware» more  AICCSA 2007»
14 years 5 months ago
The Maximum Common Subgraph Problem: Faster Solutions via Vertex Cover
In the maximum common subgraph (MCS) problem, we are given a pair of graphs and asked to find the largest induced subgraph common to them both. With its plethora of applications,...
Faisal N. Abu-Khzam, Nagiza F. Samatova, Mohamad A...
SODA
2010
ACM
171views Algorithms» more  SODA 2010»
14 years 8 months ago
Coresets and Sketches for High Dimensional Subspace Approximation Problems
We consider the problem of approximating a set P of n points in Rd by a j-dimensional subspace under the p measure, in which we wish to minimize the sum of p distances from each p...
Dan Feldman, Morteza Monemizadeh, Christian Sohler...
EPS
1998
Springer
14 years 3 months ago
Acquisition of General Adaptive Features by Evolution
We investigate the following question. Do populations of evolving agents adapt only to their recent environment or do general adaptive features appear over time? We find statistica...
Dan Ashlock, John E. Mayfield