Sciweavers

2899 search results - page 140 / 580
» Dynamic Trees in Practice
Sort
View
ICRA
2002
IEEE
92views Robotics» more  ICRA 2002»
14 years 2 months ago
Resolution Complete Rapidly-Exploring Random Trees
Trajectory design for high-dimensional systems with nonconvex constraints is a challenging problem considered in this paper. Classical dynamic programming is often employed, but c...
Peng Cheng, Steven M. LaValle
HPCC
2007
Springer
14 years 1 months ago
Power-Aware Fat-Tree Networks Using On/Off Links
Abstract. Nowadays, power consumption reduction techniques are being increasingly used in computer systems, and high-performance computing systems are not an exception. In particul...
Marina Alonso, Salvador Coll, Vicente Santonja, Ju...
CONSTRAINTS
2008
95views more  CONSTRAINTS 2008»
13 years 9 months ago
Efficient Sequence Alignment with Side-Constraints by Cluster Tree Elimination
Aligning DNA and protein sequences is a core technique in molecular biology. Often, it is desirable to include partial prior knowledge and conditions in an alignment. Going beyond...
Sebastian Will, Anke Busch, Rolf Backofen
TCAD
2008
100views more  TCAD 2008»
13 years 9 months ago
Robust Clock Tree Routing in the Presence of Process Variations
Abstract--Advances in very large-scale integration technology make clock skew more susceptible to process variations. Notwithstanding efficient exact zero-skew algorithms, clock sk...
Uday Padmanabhan, Janet Meiling Wang, Jiang Hu
NETWORKING
2011
13 years 14 days ago
Modelling and Evaluation of CCN-Caching Trees
Networking Named Content (NNC) was recently proposed as a new networking paradigm to realise Content Centric Networks (CCNs). The new paradigm changes much about the current Intern...
Ioannis Psaras, Richard G. Clegg, Raul Landa, Wei ...