Sciweavers

189 search results - page 10 / 38
» Graph-Theoretic Solutions to Computational Geometry Problems
Sort
View
DM
2008
82views more  DM 2008»
13 years 7 months ago
Problems and results in extremal combinatorics - II
Extremal Combinatorics is one of the central areas in Discrete Mathematics. It deals with problems that are often motivated by questions arising in other areas, including Theoreti...
Noga Alon
COMPGEOM
1994
ACM
13 years 11 months ago
Computing Envelopes in Four Dimensions with Applications
Let F be a collection of n d-variate, possibly partially defined, functions, all algebraic of some constant maximum degree. We present a randomized algorithm that computes the vert...
Pankaj K. Agarwal, Boris Aronov, Micha Sharir
ICCS
2009
Springer
13 years 5 months ago
Bending Virtual Spring-Damper: A Solution to Improve Local Platoon Control
This article presents a local control approach to linear vehicle platooning. Linear platoon systems are sets of vehicles that use local or global perception capabilities to form a ...
Jean-Michel Contet, Franck Gechter, Pablo Gruer, A...
COMPGEOM
2005
ACM
13 years 9 months ago
1-link shortest paths in weighted regions
We illustrate the Link Solver software for computing 1-link shortest paths in weighted regions. The Link Solver implements a prune-and-search method that can be used to approximat...
Ovidiu Daescu, James D. Palmer
VLSID
2002
IEEE
98views VLSI» more  VLSID 2002»
14 years 7 months ago
On Test Scheduling for Core-Based SOCs
We present a mathematical model for the problem of scheduling tests for core-based system-on-chip (SOC) VLSI designs. Given a set of tests for each core in the SOC and a set of te...
Sandeep Koranne