Sciweavers

1545 search results - page 211 / 309
» On tree congestion of graphs
Sort
View
FPGA
1995
ACM
149views FPGA» more  FPGA 1995»
15 years 1 months ago
PathFinder: A Negotiation-based Performance-driven Router for FPGAs
Routing FPGAs is a challenging problem because of the relative scarcity of routing resources, both wires and connection points. This can lead either to slow implementations caused...
Larry McMurchie, Carl Ebeling
MASCOTS
2003
14 years 11 months ago
A Packet-Level Simulation Study of Optimal Web Proxy Cache Placement
The Web proxy cache placement problem is often formulated as a classical optimization problem: place N proxies within an internetwork so as to minimize the average user response t...
Gwen Houtzager, Carey L. Williamson
CN
2010
103views more  CN 2010»
14 years 10 months ago
Continuum equilibria and global optimization for routing in dense static ad hoc networks
We consider massively dense ad hoc networks and study their continuum limits as the node density increases and as the graph providing the available routes becomes a continuous area...
Alonso Silva, Eitan Altman, Pierre Bernhard, M&eac...
JCP
2006
128views more  JCP 2006»
14 years 10 months ago
A Service Oriented Framework for Multimedia Radio Networks
- In order to enable fast deployment of new emerging services over multimedia radio networks, it is important to design an efficient service-based platform with necessary traffic m...
Asma Ben Letaifa, Sami Tabbane, Zièd Chouka...
IEAAIE
2009
Springer
14 years 7 months ago
Plan Repair in Conflict-Free Routing
In conflict-free routing a set of agents have to traverse a common infrastructure without interfering with each other. Maza and Castagna [1] showed how route plans can be repaired ...
Adriaan ter Mors, Cees Witteveen