Sciweavers

909 search results - page 148 / 182
» On the approximability of some network design problems
Sort
View
ACSD
2007
IEEE
67views Hardware» more  ACSD 2007»
15 years 7 months ago
Hazard Checking of Timed Asynchronous Circuits Revisited
This paper proposes a new approach for the hazard checking of timed asynchronous circuits. Previous papers proposed either exact algorithms, which suffer from statespace explosion...
Frédéric Béal, Tomohiro Yoned...
WWW
2001
ACM
16 years 2 months ago
Support concepts for Web navigation: a cognitive engineering approach
Current Network User Interfaces (NUIs) provide entrances to an enormous amount of Web-based services, bringing about new use problems such as laborious and unsuccessful navigation...
Mark A. Neerincx, Jasper Lindenberg, Steven Pember...
WINE
2005
Springer
143views Economy» more  WINE 2005»
15 years 7 months ago
Economic Mechanisms for Shortest Path Cooperative Games with Incomplete Information
Abstract. In this paper we present a cooperative game theoretic interpretation of the shortest path problem. We consider a buying agent who has a budget to go from a specified sou...
T. S. Chandrashekar, Yadati Narahari
PVLDB
2010
152views more  PVLDB 2010»
14 years 12 months ago
k-Nearest Neighbors in Uncertain Graphs
Complex networks, such as biological, social, and communication networks, often entail uncertainty, and thus, can be modeled as probabilistic graphs. Similar to the problem of sim...
Michalis Potamias, Francesco Bonchi, Aristides Gio...
MOBICOM
2006
ACM
15 years 7 months ago
Routing algorithms for delay-insensitive and delay-sensitive applications in underwater sensor networks
Underwater sensor networks consist of sensors and vehicles deployed to perform collaborative monitoring tasks over a given region. Underwater sensor networks will find applicatio...
Dario Pompili, Tommaso Melodia, Ian F. Akyildiz