Sciweavers

5165 search results - page 754 / 1033
» Consistency of the Neighbor-Net Algorithm
Sort
View
COMPGEOM
2010
ACM
15 years 10 months ago
Kinetic stable Delaunay graphs
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 ...
Pankaj K. Agarwal, Jie Gao, Leonidas J. Guibas, Ha...
INFOCOM
2002
IEEE
15 years 9 months ago
Energy Efficient Communications in Ad Hoc Networks Using Directional Antennas
— Directional antennas can be useful in significantly increasing node and network lifetime in wireless ad hoc networks. In order to utilize directional antennas, an algorithm is ...
Akis Spyropoulos, Cauligi S. Raghavendra
FUN
2010
Springer
233views Algorithms» more  FUN 2010»
15 years 9 months ago
The Complexity of Flood Filling Games
We study the complexity of the popular one player combinatorial game known as Flood-It. In this game the player is given an n×n board of tiles where each tile is allocated one of ...
David Arthur, Raphaël Clifford, Markus Jalsen...
HPDC
2000
IEEE
15 years 9 months ago
QoS and Contention-Aware Multi-Resource Reservation
To provide Quality of Service (QoS) guarantee in distributed services, it is necessary to reserve multiple computing and communication resources for each service session. Meanwhile...
Dongyan Xu, Klara Nahrstedt, Arun Viswanathan, Dua...
INFOCOM
2000
IEEE
15 years 9 months ago
Topology Discovery in Heterogeneous IP Networks
Abstract— Knowledge of the up-to-date physical topology of an IP network is crucial to a number of critical network management tasks, including reactive and proactive resource ma...
Yuri Breitbart, Minos N. Garofalakis, Cliff Martin...