8025 search results - page 290 / 1605 » Combinators Introduction: An Algorithm |
161
click to vote
ICALP
2003
Springer
15 years 12 months ago
2003
Springer
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...
200
click to vote
KES
1999
Springer
15 years 11 months ago
1999
Springer
Abstract—Dynamic Demes is a new method for the parallelisation of evolutionary algorithms. It was derived as a combination of two other parallelisation algorithms: the master-sla...
179
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
In recent years, the development of multi-objective evolutionary algorithms (MOEAs) hybridized with mathematical programming techniques has significantly increased. However, most...
191
click to vote
TPDS
2008
15 years 6 months ago
2008
Abstract-- With increasing richness in features such as personalization of content, web applications are becoming more complex and hence compute intensive. Traditional approaches t...
187
click to vote
COMGEO
1999
ACM
15 years 6 months ago
1999
ACM
The visual nature of geometry applications makes them a natural area where visualization can be an effective tool for demonstrating algorithms. In this paper we propose a new mode...