Sciweavers

879 search results - page 101 / 176
» Optimizing for Reduced Code Space using Genetic Algorithms
Sort
View
GECCO
2004
Springer
129views Optimization» more  GECCO 2004»
15 years 8 months ago
Encoding Bounded-Diameter Spanning Trees with Permutations and with Random Keys
Permutations of vertices can represent constrained spanning trees for evolutionary search via a decoder based on Prim’s algorithm, and random keys can represent permutations. Tho...
Bryant A. Julstrom
115
Voted
CORR
2008
Springer
91views Education» more  CORR 2008»
15 years 2 months ago
Particle Filtering for Large Dimensional State Spaces with Multimodal Observation Likelihoods
We study efficient importance sampling techniques for particle filtering (PF) when either (a) the observation likelihood (OL) is frequently multimodal or heavy-tailed, or (b) the s...
Namrata Vaswani
150
Voted
MMB
2012
Springer
259views Communications» more  MMB 2012»
13 years 10 months ago
Boosting Design Space Explorations with Existing or Automatically Learned Knowledge
Abstract. During development, processor architectures can be tuned and configured by many different parameters. For benchmarking, automatic design space explorations (DSEs) with h...
Ralf Jahr, Horia Calborean, Lucian Vintan, Theo Un...
SIGCOMM
2010
ACM
15 years 2 months ago
Topology-aware resource allocation for data-intensive workloads
This paper proposes an architecture for optimized resource allocation in Infrastructure-as-a-Service (IaaS)-based cloud systems. Current IaaS systems are usually unaware of the ho...
Gunho Lee, Niraj Tolia, Parthasarathy Ranganathan,...
ICTAI
2000
IEEE
15 years 7 months ago
Self-optimising CBR retrieval
One reason why Case-Based Reasoning (CBR) has become popular is because it reduces development cost compared to rule-based expert systems. Still, the knowledge engineering effort ...
Jacek Jarmulak, Susan Craw, Ray Rowe