Sciweavers

85 search results - page 3 / 17
» Improved Algorithms for Uniform Partitions of Points
Sort
View
ALENEX
2008
180views Algorithms» more  ALENEX 2008»
14 years 11 months ago
Geometric Algorithms for Optimal Airspace Design and Air Traffic Controller Workload Balancing
The National Airspace System (NAS) is designed to accommodate a large number of flights over North America. For purposes of workload limitations for air traffic controllers, the a...
Amitabh Basu, Joseph S. B. Mitchell, Girishkumar S...
COMPGEOM
2009
ACM
15 years 4 months ago
Approximate center points with proofs
We present the Iterated-Tverberg algorithm, the first deterministic algorithm for computing an approximate centerpoint of a set S ∈ Rd with running time sub-exponential in d. T...
Gary L. Miller, Donald Sheehy
UAI
1997
14 years 11 months ago
Nonuniform Dynamic Discretization in Hybrid Networks
We consider probabilistic inference in general hybrid networks, which include continuous and discrete variables in an arbitrary topology. We reexamine the question of variable dis...
Alexander V. Kozlov, Daphne Koller
EPIA
2007
Springer
15 years 3 months ago
Improving Evolutionary Algorithms with Scouting
The goal of an Evolutionary Algorithm(EA) is to find the optimal solution to a given problem by evolving a set of initial potential solutions. When the problem is multi-modal, an ...
Konstantinos Bousmalis, Gillian M. Hayes, Jeffrey ...
ICRA
2005
IEEE
135views Robotics» more  ICRA 2005»
15 years 3 months ago
Efficient Closed Contour Extraction from Range Image's Edge Points
Abstract - This paper presents an improvement over a previous contour closure algorithm. Assuming that edge points are given as input, the proposed approach consists of two steps. ...
Angel Domingo Sappa