Sciweavers

4342 search results - page 318 / 869
» Improved Algorithms for Optimal Embeddings
Sort
View
ICCS
2005
Springer
16 years 6 days ago
Heuristic Algorithm for Anycast Flow Assignment in Connection-Oriented Networks
Abstract. Replication of content on geographically distributed servers can improve both performance and reliability of the Web service. Anycast is a one-toone-of-many delivery tech...
Krzysztof Walkowiak
PATAT
2004
Springer
141views Education» more  PATAT 2004»
16 years 3 days ago
A Hybrid Multi-objective Evolutionary Algorithm for the Uncapacitated Exam Proximity Problem
A hybrid Multi-Objective Evolutionary Algorithm is used to tackle the uncapacitated exam proximity problem. In this hybridization, local search operators are used instead of the tr...
Pascal Côté, Tony Wong, Robert Sabour...
SODA
2004
ACM
155views Algorithms» more  SODA 2004»
15 years 8 months ago
Navigating nets: simple algorithms for proximity search
d Abstract] Robert Krauthgamer James R. Lee We present a simple deterministic data structure for maintaining a set S of points in a general metric space, while supporting proximit...
Robert Krauthgamer, James R. Lee
WSC
1998
15 years 8 months ago
Using ACCESSIBILITY to Assess the Performance of Generalized Hill Climbing Algorithms
The search problem, ACCESSIBILITY, asks whether a finite sequence of events can be found such that, starting with a specific initial event, a particular state can be reached. This...
Sheldon H. Jacobson, Enver Yücesan
CEC
2007
IEEE
15 years 7 months ago
Designing memetic algorithms for real-world applications using self-imposed constraints
— Memetic algorithms (MAs) combine the global exploration abilities of evolutionary algorithms with a local search to further improve the solutions. While a neighborhood can be e...
Thomas Michelitsch, Tobias Wagner, Dirk Biermann, ...