Sciweavers

4305 search results - page 293 / 861
» The Test of Time
Sort
View
GI
2009
Springer
15 years 4 months ago
An Application for Simulations at Large Pickup and Delivery Service Providers
: Over time, large scale pickup and delivery providers acquire considerable amounts of data on customer orders, including order times, amount and configurations of freight, as well...
Curt Nowak, Klaus Ambrosi, Felix Hahne
GD
2005
Springer
16 years 7 days ago
C-Planarity of Extrovert Clustered Graphs
A clustered graph has its vertices grouped into clusters in a hierarchical way via subset inclusion, thereby imposing a tree structure on the clustering relationship. The c-planari...
Michael T. Goodrich, George S. Lueker, Jonathan Z....
ISCAS
2003
IEEE
167views Hardware» more  ISCAS 2003»
16 years 1 hour ago
The multi-level paradigm for distributed fault detection in networks with unreliable processors
In this paper, we study the effectiveness of the multilevel paradigm in considerably reducing the diagnosis latency of distributed algorithms for fault detection in networks with ...
Krishnaiyan Thulasiraman, Ming-Shan Su, V. Goel
ICMCS
2008
IEEE
129views Multimedia» more  ICMCS 2008»
16 years 1 months ago
Evaluation of segment-based proxy caching for video on demand
In this paper, we derive an analytical model for the evaluation of the performance of a Video on Demand (VoD) system. The model estimates the mean waiting time achievable by the P...
Muhammad Muhammad, Wei Tu, Eckehard G. Steinbach
GD
2007
Springer
15 years 10 months ago
Efficient Extraction of Multiple Kuratowski Subdivisions
Abstract. A graph is planar if and only if it does not contain a Kuratowski subdivision. Hence such a subdivision can be used as a witness for non-planarity. Modern planarity testi...
Markus Chimani, Petra Mutzel, Jens M. Schmidt