Sciweavers

1629 search results - page 5 / 326
» Infeasible Code Detection
Sort
View
PPSN
2000
Springer
13 years 11 months ago
A Hybrid GA for the Edge-Biconnectivity Augmentation Problem
In the design of communication networks, robustness against failures in single links or nodes is an important issue. This paper proposes a new approach for the NP-complete edge-bic...
Ivana Ljubic, Günther R. Raidl, Jozef Kratica
APAQS
2001
IEEE
13 years 11 months ago
A Path-Based Approach to the Detection of Infinite Looping
Infinite looping is a common type of program error. This paper studies the detection of infinite loops in imperative programs. A sufficient condition is given, which is based on p...
Jian Zhang
ICRA
2005
IEEE
118views Robotics» more  ICRA 2005»
14 years 1 months ago
Learning-Assisted Multi-Step Planning
— Probabilistic sampling-based motion planners are unable to detect when no feasible path exists. A common heuristic is to declare a query infeasible if a path is not found in a ...
Kris K. Hauser, Timothy Bretl, Jean-Claude Latombe
ICCAD
1999
IEEE
120views Hardware» more  ICCAD 1999»
14 years 1 days ago
Design and optimization of LC oscillators
We present a method for optimizing and automating component and transistor sizing for CMOS LC oscillators. We observe that the performance measures can be formulated as posynomial...
Maria del Mar Hershenson, Ali Hajimiri, Sunderaraj...