Sciweavers

2796 search results - page 205 / 560
» The coolest path problem
Sort
View
ITC
1998
IEEE
61views Hardware» more  ITC 1998»
15 years 10 months ago
Test session oriented built-in self-testable data path synthesis
Existing high-level BIST synthesis methods focus on one objective, minimizing either area overhead or test time. Hence, those methods do not render exploration of large design spa...
Han Bin Kim, Takeshi Takahashi, Dong Sam Ha
CORR
2010
Springer
138views Education» more  CORR 2010»
15 years 6 months ago
Optimal Path Planning under Temporal Logic Constraints
Abstract-- In this paper we present a method for automatically generating optimal robot trajectories satisfying high level mission specifications. The motion of the robot in the en...
Stephen L. Smith, Jana Tumova, Calin Belta, Daniel...
ACTA
2002
111views more  ACTA 2002»
15 years 6 months ago
Adding a path connectedness operator to FO+poly (linear)
In the constraint database community, FO+poly and FO+linear have been proposed as foundations for spatial database query languages. One of the strengths of this approach is that t...
Chris Giannella, Dirk Van Gucht
INFOCOM
2009
IEEE
16 years 1 months ago
Locally vs. Globally Optimized Flow-Based Content Distribution to Mobile Nodes
—The paper deals with efficient distribution of timely information to flows of mobile devices. We consider the case where a set of Information Dissemination Devices (IDDs) broa...
Mhameed Aezladen, Reuven Cohen, Danny Raz
ICRA
2008
IEEE
117views Robotics» more  ICRA 2008»
16 years 1 months ago
Tracking hidden agents through shadow information spaces
— This paper addresses problems of inferring the locations of moving agents from combinatorial data extracted by robots that carry sensors. The agents move unpredictably and may ...
Jingjin Yu, Steven M. LaValle