1518 search results - page 249 / 304 » Exact and Approximate Bandwidth |
FMSD
2006
14 years 9 months ago
2006
We propose a refinement approach to language emptiness, which is based on the enumeration and the successive refinements of SCCs on over-approximations of the exact system. Our alg...
IJRR
2008
14 years 9 months ago
2008
The motion-planning problem, involving the computation of a collision-free path for a moving entity amidst obstacles, is a central problem in fields like Robotics and Game Design....
DAM
2007
14 years 9 months ago
2007
It is now well-documented that the structure of evolutionary relationships between a set of present-day species is not necessarily tree-like. The reason for this is that reticulat...
146
click to vote
JCO
2006
14 years 9 months ago
2006
We study a novel "coverage by directional sensors" problem with tunable orientations on a set of discrete targets. We propose a Maximum Coverage with Minimum Sensors (MCM...
MP
2008
14 years 9 months ago
2008
: We present polynomial-time interior-point algorithms for solving the Fisher and Arrow-Debreu competitive market equilibrium problems with linear utilities and n players. Both of ...