Sciweavers

5329 search results - page 280 / 1066
» The Weighted Majority Algorithm
Sort
View
ICANNGA
2009
Springer
130views Algorithms» more  ICANNGA 2009»
16 years 1 months ago
String Distances and Uniformities
Abstract. The Levenstein or edit distance was developed as a metric for calculating distances between character strings. We are looking at weighting the different edit operations (...
David W. Pearson, Jean-Christophe Janodet
FUN
2007
Springer
91views Algorithms» more  FUN 2007»
16 years 24 days ago
High Spies (or How to Win a Programming Contest)
We analyse transports between leaves in an edge-weighted tree. We prove under which conditions there exists a transport matching the weights of a given tree. We use this to compute...
André H. Deutz, Rudy van Vliet, Hendrik Jan...
WAW
2007
Springer
120views Algorithms» more  WAW 2007»
16 years 22 days ago
Giant Component and Connectivity in Geographical Threshold Graphs
The geographical threshold graph model is a random graph model with nodes distributed in a Euclidean space and edges assigned through a function of distance and node weights. We st...
Milan Bradonjic, Aric A. Hagberg, Allon G. Percus
GECCO
2004
Springer
112views Optimization» more  GECCO 2004»
16 years 8 hour ago
Some Issues on the Implementation of Local Search in Evolutionary Multiobjective Optimization
This paper discusses the implementation of local search in evolutionary multiobjective optimization (EMO) algorithms for the design of a simple but powerful memetic EMO algorithm. ...
Hisao Ishibuchi, Kaname Narukawa
ICALP
2010
Springer
15 years 10 months ago
Scalably Scheduling Power-Heterogeneous Processors
We show that a natural online algorithm for scheduling jobs on a heterogeneous multiprocessor, with arbitrary power functions, is scalable for the objective function of weighted ï¬...
Anupam Gupta, Ravishankar Krishnaswamy, Kirk Pruhs