Sciweavers

380 search results - page 46 / 76
» Towards an Optimal Routing Strategy
Sort
View
DAC
2009
ACM
14 years 9 months ago
Handling don't-care conditions in high-level synthesis and application for reducing initialized registers
Don't-care conditions provide additional flexibility in logic synthesis and optimization. However, most work only focuses on the gate level because it is difficult to handle ...
Hong-Zu Chou, Kai-Hui Chang, Sy-Yen Kuo
ICNP
2006
IEEE
14 years 2 months ago
Characterizing and Mitigating Inter-domain Policy Violations in Overlay Routes
— The Internet is a complex structure arising from the interconnection of numerous autonomous systems (AS), each exercising its own administrative policies to reflect the commer...
Srinivasan Seetharaman, Mostafa H. Ammar
JSAC
2008
165views more  JSAC 2008»
13 years 8 months ago
Energy-Efficient Routing Schemes for Underwater Acoustic Networks
Interest in underwater acoustic networks has grown rapidly with the desire to monitor the large portion of the world covered by oceans. Fundamental differences between underwater a...
Michele Zorzi, Paolo Casari, Nicola Baldo, Albert ...
ISAAC
2003
Springer
97views Algorithms» more  ISAAC 2003»
14 years 1 months ago
Equilibria for Networks with Malicious Users
We consider the problem of characterizing user equilibria and optimal solutions for selfish routing in a given network. We extend the known models by considering malicious behavio...
George Karakostas, Anastasios Viglas
SIGMOD
1998
ACM
117views Database» more  SIGMOD 1998»
14 years 21 days ago
The Pyramid-Technique: Towards Breaking the Curse of Dimensionality
In this paper, we propose the Pyramid-Technique, a new indexing method for high-dimensional data spaces. The PyramidTechnique is highly adapted to range query processing using the...
Stefan Berchtold, Christian Böhm, Hans-Peter ...