Sciweavers

2796 search results - page 158 / 560
» The coolest path problem
Sort
View
ICRA
2010
IEEE
119views Robotics» more  ICRA 2010»
15 years 4 months ago
Evader surveillance under incomplete information
— This paper is concerned with determining whether a mobile robot, called the pursuer, is up to maintaining visibility of an antagonist agent, called the evader. This problem, a ...
Israel Becerra, Rafael Murrieta-Cid, Raul Monroy
INFOCOM
2010
IEEE
15 years 4 months ago
Routing Primitives for Wireless Mesh Networks: Design, Analysis and Experiments
—In this paper, we consider routing in multi-hop wireless mesh networks. We analyze three standardized and commonly deployed routing mechanisms that we term “nodepair discovery...
Stanislav Miskovic, Edward W. Knightly
JSS
2007
120views more  JSS 2007»
15 years 6 months ago
The design and evaluation of path matching schemes on compressed control flow traces
A control flow trace captures the complete sequence of dynamically executed basic blocks and function calls. It is usually of very large size and therefore commonly stored in com...
Yongjing Lin, Youtao Zhang, Rajiv Gupta
IPPS
2008
IEEE
16 years 17 days ago
We have it easy, but do we have it right?
We show two severe problems with the state of the art in empirical computer system performance evaluation, observer effect and measurement context bias, and we outline the path to...
Todd Mytkowicz, Amer Diwan, Matthias Hauswirth, Pe...
ADG
2000
Springer
110views Mathematics» more  ADG 2000»
15 years 10 months ago
Decision Complexity in Dynamic Geometry
Abstract. Geometric straight-line programs [5, 8] can be used to model geometric constructions and their implicit ambiguities. In this paper we discuss the complexity of deciding w...
Ulrich Kortenkamp, Jürgen Richter-Gebert