Sciweavers

3218 search results - page 203 / 644
» Timed Extensions for SDL
Sort
View
WEA
2009
Springer
145views Algorithms» more  WEA 2009»
15 years 12 months ago
Batch Dynamic Single-Source Shortest-Path Algorithms: An Experimental Study
A dynamic shortest-path algorithm is called a batch algorithm if it is able to handle graph changes that consist of multiple edge updates at a time. In this paper we focus on fully...
Reinhard Bauer, Dorothea Wagner
172
Voted
TIME
2009
IEEE
15 years 11 months ago
Preserving Anonymity of Recurrent Location-Based Queries
—The anonymization of location based queries through the generalization of spatio-temporal information has been proposed as a privacy preserving technique. We show that the prese...
Daniele Riboni, Linda Pareschi, Claudio Bettini, S...
CEC
2008
IEEE
15 years 11 months ago
A genetic algorithm for optimizing hierarchical menus
— Hierarchical menus are widely used as a standard user interface in modern applications that use GUIs. The performance of the menu depends on many factors: structure, layout, co...
Shouichi Matsui, Seiji Yamada
ICC
2008
IEEE
166views Communications» more  ICC 2008»
15 years 11 months ago
Multi-Initiator Connected Dominating Set Construction for Mobile Ad Hoc Networks
— The connected dominating set (CDS) has been extensively used for routing and broadcast in mobile ad hoc networks. While existing CDS protocols are successful in constructing CD...
Kazuya Sakai, Fangyang Shen, Kyoung Min Kim, Min-T...
ICRA
2008
IEEE
197views Robotics» more  ICRA 2008»
15 years 11 months ago
A Bayesian framework for optimal motion planning with uncertainty
— Modeling robot motion planning with uncertainty in a Bayesian framework leads to a computationally intractable stochastic control problem. We seek hypotheses that can justify a...
Andrea Censi, Daniele Calisi, Alessandro De Luca, ...