Sciweavers

516 search results - page 77 / 104
» Generalizing the Discrete Timed Automaton
Sort
View
COMPGEOM
2001
ACM
14 years 1 months ago
Computational geometry for sculpture
This presentation illustrates examples of my geometric sculpture and outlines certain design techniques. I apply methods from the field of computational geometry to the creation o...
George W. Hart
SODA
2010
ACM
397views Algorithms» more  SODA 2010»
14 years 7 months ago
Improved Approximation Algorithms for the Minimum Latency Problem via Prize-Collecting Strolls
The minimum latency problem (MLP) is a well-studied variant of the traveling salesman problem (TSP). In the MLP, the server's goal is to minimize the average latency that the...
Aaron Archer, Anna Blasiak
COMPGEOM
2010
ACM
14 years 3 months ago
A dynamic data structure for approximate range searching
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
David M. Mount, Eunhui Park
WSC
2001
13 years 11 months ago
Using simulation to evaluate site traffic at an automobile truck plant
Recent trends in automotive manufacturing have increased the focus on the Just-In-Time (JIT) delivery of automotive components. By requiring smaller batches of parts delivered mor...
Joseph Hugan
CORR
2006
Springer
113views Education» more  CORR 2006»
13 years 10 months ago
A Unified View of TD Algorithms; Introducing Full-Gradient TD and Equi-Gradient Descent TD
This paper addresses the issue of policy evaluation in Markov Decision Processes, using linear function approximation. It provides a unified view of algorithms such as TD(), LSTD()...
Manuel Loth, Philippe Preux