Sciweavers

2796 search results - page 341 / 560
» The coolest path problem
Sort
View
EDBT
2008
ACM
135views Database» more  EDBT 2008»
16 years 6 months ago
Minimizing latency and memory in DSMS: a unified approach to quasi-optimal scheduling
Data Stream Management Systems (DSMSs) must support optimized execution scheduling of multiple continuous queries on massive, and frequently bursty, data streams. Previous approac...
Yijian Bai, Carlo Zaniolo
ICDE
2010
IEEE
212views Database» more  ICDE 2010»
16 years 6 months ago
ViewJoin: Efficient View-based Evaluation of Tree Pattern Queries
A fundamental problem in XML query processing is tree pattern query (TPQ) matching which computes all data instances in an XML database that match an input TPQ. There is a lot of r...
Ding Chen, Chee-Yong Chan
ICCAD
2003
IEEE
113views Hardware» more  ICCAD 2003»
16 years 3 months ago
Retiming with Interconnect and Gate Delay
In this paper, we study the problem of retiming of sequential circuits with both interconnect and gate delay. Most retiming algorithms have assumed ideal conditions for the non-lo...
Chris C. N. Chu, Evangeline F. Y. Young, Dennis K....
ICRA
2009
IEEE
98views Robotics» more  ICRA 2009»
16 years 1 months ago
Multi-robot routing with linear decreasing rewards over time
Abstract— We study multi-robot routing problems (MRLDR) where a team of robots has to visit a set of given targets with linear decreasing rewards over time, such as required for ...
Ali Ekici, Pinar Keskinocak, Sven Koenig
INFOCOM
2009
IEEE
16 years 1 months ago
Tracking with Unreliable Node Sequences
—Tracking mobile targets using sensor networks is a challenging task because of the impacts of in-the-filed factors such as environment noise, sensing irregularity and etc. This...
Ziguo Zhong, Ting Zhu, Dan Wang, Tian He