5356 search results - page 201 / 1072 » Adventures in time and space |
196
click to vote
CCCG
2003
15 years 8 months ago
2003
In this paper we consider the problem of computing the closest point to the boundary of a circle among a set S of n points. We present two algorithms to solve this problem. One al...
273
click to vote
Publication
I. Introduction
II. Foundations
A. The Mathematical Structure of Physical Field Theories
B. Geometric Objects and Orientation
1. Space-Time Object...
323
click to vote
Publication
I. Introduction
II. Foundations
A. The Mathematical Structure of Physical Field Theories
B. Geometric Objects and Orientation
1. Space-Time Object...
158
click to vote
GECCO
2009
Springer
15 years 11 months ago
2009
Springer
The DIRECT global optimization algorithm is tested on the BBOB 2009 testbed. The algorithm is rather time and space consuming since it does not forget any point it samples during ...
118
click to vote
ALGORITHMICA
2010
15 years 6 months ago
2010
We describe space-efficient algorithms for solving problems related to finding maxima among points in two and three dimensions. Our algorithms run in optimal O(n log n) time and oc...