Sciweavers

98 search results - page 7 / 20
» Simplifying reductions
Sort
View
ICCAD
1996
IEEE
85views Hardware» more  ICCAD 1996»
15 years 1 months ago
Exploiting regularity for low-power design
Abstract -- Current day behavioral-synthesis techniques produce architectures that are power-inefficient in the interconnect. Experiments have demonstrated that in synthesized desi...
Renu Mehra, Jan M. Rabaey
APPROX
2008
Springer
134views Algorithms» more  APPROX 2008»
14 years 11 months ago
Inapproximability of Survivable Networks
In the Survivable Network Design Problem (SNDP) one seeks to find a minimum cost subgraph that satisfies prescribed node-connectivity requirements. We give a novel approximation r...
Yuval Lando, Zeev Nutov
APN
2000
Springer
15 years 1 months ago
Pre- and Post-agglomerations for LTL Model Checking
One of the most efficient analysis technique is to reduce an original model into a simpler one such that the reduced model has the same properties than the original one. G. Berthel...
Denis Poitrenaud, Jean-François Pradat-Peyr...
ICIRA
2010
Springer
115views Robotics» more  ICIRA 2010»
14 years 8 months ago
A Resistance Compensation Control Algorithm for a Cable-Driven Hand Exoskeleton for Motor Function Rehabilitation
The resistance compensation, especially the friction compensation in the Bowden cable transmission is a difficult issue to be handled. Aimed to the resistance reduction requirement...
Shuang Wang, Jiting Li, Ruoyin Zheng
ECOOP
1998
Springer
15 years 1 months ago
An Imperative, First-Order Calculus with Object Extension
This paper presents an imperative object calculus designed to support class-based programming via a combination of extensible objects and encapsulation. This calculus simplifies th...
Viviana Bono, Kathleen Fisher