270 search results - page 53 / 54 » Dynamic Complexity Theory Revisited |
MOBICOM
2003
ACM
13 years 11 months ago
2003
ACM
We develop algorithms for finding minimum energy disjoint paths in an all-wireless network, for both the node and linkdisjoint cases. Our major results include a novel polynomial...
COMPGEOM
2010
ACM
13 years 11 months ago
2010
ACM
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
FOCS
2000
IEEE
13 years 10 months ago
2000
IEEE
In this article, we show several results obtained by combining the use of stable distributions with pseudorandom generators for bounded space. In particular: —We show that, for a...
RTCSA
1999
IEEE
13 years 10 months ago
1999
IEEE
ASTRAL is a high-level formal specification language for real-time (infinite state) systems. It is provided with structuring mechanisms that allow one to build modularized specifi...
HICSS
1994
IEEE
13 years 10 months ago
1994
IEEE
Meeting research and especially research on Computer Supported Meetings of natural teams is not available in abundance. What is reported of meetings often uses a rather limited th...