Sciweavers

41 search results - page 6 / 9
» Shortest Descending Paths through Given Faces
Sort
View
ICDCS
1999
IEEE
13 years 11 months ago
Search Space Reduction in QoS Routing
To provide real-time service or engineer constrained-based paths, networks require the underlying routing algorithm to be able to find low-cost paths that satisfy given Quality-of...
Liang Guo, Ibrahim Matta
INFOCOM
2003
IEEE
14 years 22 days ago
Increasing the Robustness of IP Backbones in the Absence of Optical Level Protection
— There are two fundamental technology issues that challenge the robustness of IP backbones. First, SONET protection is gradually being removed because of its high cost (while SO...
Frédéric Giroire, Antonio Nucci, Nin...
DATE
2006
IEEE
91views Hardware» more  DATE 2006»
13 years 11 months ago
Efficient incremental clock latency scheduling for large circuits
The clock latency scheduling problem is usually solved on the sequential graph, also called register-to-register graph. In practice, the the extraction of the sequential graph for...
Christoph Albrecht
SAB
2010
Springer
153views Optimization» more  SAB 2010»
13 years 5 months ago
Cooperative Stigmergic Navigation in a Heterogeneous Robotic Swarm
We study self-organized cooperation in a heterogeneous robotic swarm consisting of two sub-swarms. The robots of each sub-swarm play distinct roles based on their different charac...
Frederick Ducatelle, Gianni A. Di Caro, Luca Maria...
VLDB
2008
ACM
103views Database» more  VLDB 2008»
14 years 7 months ago
The optimal sequenced route query
Several variations of nearest neighbor (NN) query have been investigated by the database community. However, realworld applications often result in the formulation of new variatio...
Mehdi Sharifzadeh, Mohammad R. Kolahdouzan, Cyrus ...