Sciweavers

2796 search results - page 231 / 560
» The coolest path problem
Sort
View
DATE
2002
IEEE
74views Hardware» more  DATE 2002»
15 years 11 months ago
Maze Routing with Buffer Insertion under Transition Time Constraints
In this paper, we address the problem of simultaneous routing and buffer insertion. Recently in [12, 22], the authors considered simultaneous maze routing and buffer insertion und...
Li-Da Huang, Minghorng Lai, D. F. Wong, Youxin Gao
NETWORKS
2002
15 years 6 months ago
Approximation algorithms for constructing wavelength routing networks
Consider a requirement graph whose vertices represent customers and an edge represents the need to route a unit of flow between its end vertices along a single path. All of these ...
Refael Hassin, Asaf Levin
ICRA
2010
IEEE
142views Robotics» more  ICRA 2010»
15 years 5 months ago
Learning and planning high-dimensional physical trajectories via structured Lagrangians
— We consider the problem of finding sufficiently simple models of high-dimensional physical systems that are consistent with observed trajectories, and using these models to s...
Paul Vernaza, Daniel D. Lee, Seung-Joon Yi
MATES
2010
Springer
15 years 5 months ago
Context-Aware Route Planning
Context-aware routing is the problem of finding the shortest route from a start location to a destination location while taking into account the planned movements of other agents...
Adriaan ter Mors, Cees Witteveen, Jonne Zutt, Fern...
CHI
2011
ACM
14 years 10 months ago
Feedlack detects missing feedback in web applications
While usability methods such as user studies and inspections can reveal a wide range of problems, they do so for only a subset of an application’s features and states. We presen...
Andrew J. Ko, Xing Zhang