Sciweavers

773 search results - page 41 / 155
» Traversing the Machining Graph
Sort
View
DATE
2007
IEEE
130views Hardware» more  DATE 2007»
15 years 4 months ago
A novel criticality computation method in statistical timing analysis
Abstract— The impact of process variations increases as technology scales to nanometer region. Under large process variations, the path and arc/node criticality [18] provide effe...
Feng Wang 0004, Yuan Xie, Hai Ju
ROBOCUP
2007
Springer
134views Robotics» more  ROBOCUP 2007»
15 years 3 months ago
A Scalable Hybrid Multi-robot SLAM Method for Highly Detailed Maps
Abstract. Recent successful SLAM methods employ hybrid map representations combining the strengths of topological maps and occupancy grids. Such representations often facilitate mu...
Max Pfingsthorn, Bayu Slamet, Arnoud Visser
62
Voted
ASPLOS
2004
ACM
15 years 3 months ago
Scalable selective re-execution for EDGE architectures
Pipeline flushes are becoming increasingly expensive in modern microprocessors with large instruction windows and deep pipelines. Selective re-execution is a technique that can r...
Rajagopalan Desikan, Simha Sethumadhavan, Doug Bur...
ESOP
2009
Springer
15 years 1 months ago
An Efficient Algorithm for Solving the Dyck-CFL Reachability Problem on Trees
The context-free language (CFL) reachability problem is well known and studied in computer science, as a fundamental problem underlying many important static analyses such as point...
Hao Yuan, Patrick Th. Eugster
EWCBR
2008
Springer
14 years 11 months ago
Real-Time Plan Adaptation for Case-Based Planning in Real-Time Strategy Games
Abstract. Case-based planning (CBP) is based on reusing past successful plans for solving new problems. CBP is particularly useful in environments where the large amount of time re...
Neha Sugandh, Santiago Ontañón, Ashw...