12950 search results - page 176 / 2590 » On Optimal Timed Strategies |
237
click to vote
ICDE
2009
IEEE
16 years 6 months ago
2009
IEEE
Materializing results from complex aggregation queries helps to significantly improve response times in OLAP servers. This problem is known as the view selection problem: choosing ...
148
click to vote
SIGMOD
2004
ACM
16 years 4 months ago
2004
ACM
In this paper we present an efficient, scalable and general algorithm for performing set joins on predicates involving various similarity measures like intersect size, Jaccard-coe...
148
click to vote
DDECS
2008
IEEE
15 years 10 months ago
2008
IEEE
Abstract—In Network-on-Chip (NoC) application design, coreto-node mapping is an important but intractable optimization problem. In the paper, we use simulated annealing to tackle...
134
click to vote
ICDE
2006
IEEE
15 years 10 months ago
2006
IEEE
Although the ant metaphor has been successfully applied to routing of data packets both in wireless and fixed networks, little is yet known about its applicability to the task of...
109
click to vote
ICRA
2005
IEEE
15 years 10 months ago
2005
IEEE
— It is well-known that the Kalman filter for simultaneous localization and mapping (SLAM) converges to a fully correlated map in the limit of infinite time and data [1]. Howev...