1717 search results - page 124 / 344 » On the analysis of the (1 1) memetic algorithm |
163
click to vote
IPL
2002
15 years 6 months ago
2002
An algorithm, described by Sedgewick, finds the distance between the closest pair of n given points in a plane using a variant of mergesort. This takes O(n log n) time. To prove t...
231
click to vote
SENSYS
2006
ACM
16 years 11 days ago
2006
ACM
We explore fundamental performance limits of tracking a target in a two-dimensional field of binary proximity sensors, and design algorithms that attain those limits. In particul...
176
click to vote
COLT
2006
Springer
15 years 10 months ago
2006
Springer
In an online convex optimization problem a decision-maker makes a sequence of decisions, i.e., chooses a sequence of points in Euclidean space, from a fixed feasible set. After ea...
178
click to vote
CADE
2005
Springer
16 years 6 months ago
2005
Springer
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
208
click to vote
MIR
2003
ACM
15 years 11 months ago
2003
ACM
CDN (Content Delivery Networks) improves end-user performance by replicating web contents on a group of geographically distributed content servers. Replication Algorithm plays an ...