Sciweavers

5580 search results - page 1020 / 1116
» Randomized priority algorithms
Sort
View
ATAL
2009
Springer
14 years 2 months ago
Context-aware multi-stage routing
In context-aware route planning, a set of agents has to plan routes on a common infrastructure and each agent has to plan a conflict-free route from a source to a destination wit...
Adriaan ter Mors, Jeroen van Belle, Cees Witteveen
CIKM
2009
Springer
14 years 2 months ago
A general markov framework for page importance computation
We propose a General Markov Framework for computing page importance. Under the framework, a Markov Skeleton Process is used to model the random walk conducted by the web surfer on...
Bin Gao, Tie-Yan Liu, Zhiming Ma, Taifeng Wang, Ha...
COMPGEOM
2009
ACM
14 years 2 months ago
Epsilon nets and union complexity
We consider the following combinatorial problem: given a set of n objects (for example, disks in the plane, triangles), and an integer L ≥ 1, what is the size of the smallest su...
Kasturi R. Varadarajan
IPPS
2008
IEEE
14 years 2 months ago
Sweep coverage with mobile sensors
Many efforts have been made for addressing coverage problems in sensor networks. They fall into two categories, full coverage and barrier coverage, featured as static coverage. In...
Wei-Fang Cheng, Mo Li, Kebin Liu, Yunhao Liu, Xian...
ISVLSI
2007
IEEE
150views VLSI» more  ISVLSI 2007»
14 years 2 months ago
Minimum-Congestion Placement for Y-interconnects: Some studies and observations
— Y -interconnects for VLSI chips are based on the use of global and semi-global wiring in only 0◦ , 60◦ , and 120◦ . Though X-interconnects are fast replacing the traditio...
Tuhina Samanta, Prasun Ghosal, Hafizur Rahaman, Pa...
« Prev « First page 1020 / 1116 Last » Next »