Sciweavers

1047 search results - page 75 / 210
» Searching Without a Heuristic: Efficient Use of Abstraction
Sort
View
SOCO
2012
Springer
12 years 3 months ago
Variable mesh optimization for continuous optimization problems
Abstract Population-based meta-heuristics are algorithms that can obtain very good results for complex continuous optimization problems in a reduced amount of time. These search al...
Amilkar Puris, Rafael Bello, Daniel Molina, Franci...
GPEM
2000
121views more  GPEM 2000»
13 years 7 months ago
Bayesian Methods for Efficient Genetic Programming
ct. A Bayesian framework for genetic programming GP is presented. This is motivated by the observation that genetic programming iteratively searches populations of fitter programs ...
Byoung-Tak Zhang
IMCSIT
2010
13 years 5 months ago
Finding Patterns in Strings using Suffixarrays
Abstract--Finding regularities in large data sets requires implementations of systems that are efficient in both time and space requirements. Here, we describe a newly developed sy...
Herman Stehouwer, Menno van Zaanen
DATE
2002
IEEE
102views Hardware» more  DATE 2002»
14 years 25 days ago
Improving Placement under the Constant Delay Model
In this paper, we show that under the constant delay model the placement problem is equivalent to minimizing a weighted sum of wire lengths. The weights can be efficiently compute...
Kolja Sulimma, Wolfgang Kunz, Ingmar Neumann, Luka...
CNSM
2010
13 years 5 months ago
Gossip-based resource management for cloud environments
1 We address the problem of resource management for a large-scale cloud environment that hosts sites. Our contribution centers around outlining a distributed middleware architectur...
Fetahi Wuhib, Rolf Stadler, Mike Spreitzer