Sciweavers

1566 search results - page 117 / 314
» Saving Space in a Time Efficient Simulation Algorithm
Sort
View
GRID
2010
Springer
13 years 5 months ago
Dynamic Partitioning of GATE Monte-Carlo Simulations on EGEE
Abstract The EGEE grid offers the necessary infrastructure and resources for reducing the running time of particle tracking Monte-Carlo applications like GATE. However, efforts are...
Sorina Camarasu-Pop, Tristan Glatard, Jakub T. Mos...
ICRA
2009
IEEE
126views Robotics» more  ICRA 2009»
13 years 5 months ago
Time-bounded lattice for efficient planning in dynamic environments
For vehicles navigating initially unknown cluttered environments, current state-of-the-art planning algorithms are able to plan and re-plan dynamically-feasible paths efficiently a...
Aleksandr Kushleyev, Maxim Likhachev
ICC
2007
IEEE
111views Communications» more  ICC 2007»
14 years 2 months ago
Computationally Efficient Optimal Discrete Bit Allocation for Medium and High Target Bit Rate DMT Transmissions
—A computationally efficient optimal discrete bit allocation algorithm is proposed for medium and high target bit rate discrete multitone (DMT) transmissions. Unlike conventional...
Li-ping Zhu, Xiaofeng Zhong, Yan Yao, Shi-wei Dong...
CRV
2011
IEEE
352views Robotics» more  CRV 2011»
12 years 8 months ago
Conformative Filter: A Probabilistic Framework for Localization in Reduced Space
— Algorithmic problem reduction is a fundamental approach to problem solving in many fields, including robotics. To solve a problem using this scheme, we must reduce the problem...
Chatavut Viriyasuthee, Gregory Dudek
ANCS
2006
ACM
13 years 12 months ago
Packet classification using coarse-grained tuple spaces
While the problem of high performance packet classification has received a great deal of attention in recent years, the research community has yet to develop algorithmic methods t...
Haoyu Song, Jonathan S. Turner, Sarang Dharmapurik...