Sciweavers

11862 search results - page 2267 / 2373
» Relative information completeness
Sort
View
INFOCOM
2007
IEEE
14 years 3 months ago
Landmark Selection and Greedy Landmark-Descent Routing for Sensor Networks
—We study the problem of landmark selection for landmark-based routing in a network of fixed wireless communication nodes. We present a distributed landmark selection algorithm ...
An Nguyen, Nikola Milosavljevic, Qing Fang, Jie Ga...
LANOMS
2007
IEEE
172views Education» more  LANOMS 2007»
14 years 3 months ago
Implementing and Deploying Network Monitoring Service Oriented Architectures
—Recently there is a growing interest in accessing network measurement and status data across multiple domains, in order to detect eventual network problems which can hinder the ...
Leobino Nascimento Sampaio, Ivo Koga, Rafael Costa...
ALGOSENSORS
2007
Springer
14 years 3 months ago
Maximal Breach in Wireless Sensor Networks: Geometric Characterization and Algorithms
e for abstract modeling, algorithmic design and analysis to achieve provably efficient, scalable and fault-tolerant realizations of such huge, highly-dynamic, complex, non-conventi...
Anirvan DuttaGupta, Arijit Bishnu, Indranil Sengup...
APN
2007
Springer
14 years 3 months ago
ProM 4.0: Comprehensive Support for Real Process Analysis
This tool paper describes the functionality of ProM. Version 4.0 of ProM has been released at the end of 2006 and this version reflects recent achievements in process mining. Proc...
Wil M. P. van der Aalst, Boudewijn F. van Dongen, ...
ATAL
2007
Springer
14 years 3 months ago
Sharing experiences to learn user characteristics in dynamic environments with sparse data
This paper investigates the problem of estimating the value of probabilistic parameters needed for decision making in environments in which an agent, operating within a multi-agen...
David Sarne, Barbara J. Grosz
« Prev « First page 2267 / 2373 Last » Next »