4843 search results - page 491 / 969 » The Shortcut Problem - Complexity and Approximation |
173
click to vote
QEST
2008
IEEE
16 years 21 days ago
2008
IEEE
In [3] a probabilistic semantics for timed automata has been defined in order to rule out unlikely (sequences of) events. The qualitative model-checking problem for LTL propertie...
150
click to vote
GD
2007
Springer
16 years 15 days ago
2007
Springer
In John Tantalo’s on-line game Planarity the player is given a non-plane straight-line drawing of a planar graph. The aim is to make the drawing plane as quickly as possible by m...
154
click to vote
ICRA
2006
IEEE
16 years 11 days ago
2006
IEEE
— Mobile robots have successfully solved many real world problems. In the following we present the use of mobile robots to address the novel and challenging problem of providing ...
145
click to vote
SRDS
2006
IEEE
16 years 10 days ago
2006
IEEE
In order to safeguard a sensitive database, we must ensure both its privacy and its longevity. However, privacy and longevity tend to be competing objectives. We show how to desig...
171
click to vote
VTC
2006
IEEE
16 years 10 days ago
2006
IEEE
We study the problem of minimum energy cooperative path (MECP) routing in wireless networks. The joint problem of cooperative routing in wireless networks that combines route sele...