Sciweavers

3221 search results - page 319 / 645
» Termination of Linear Programs
Sort
View
SENSYS
2004
ACM
16 years 1 days ago
MNP: multihop network reprogramming service for sensor networks
Reprogramming of sensor networks is an important and challenging problem as it is often necessary to reprogram the sensors in place. In this paper, we propose a multihop reprogram...
Limin Wang
ISSAC
2004
Springer
185views Mathematics» more  ISSAC 2004»
15 years 12 months ago
Automatic generation of polynomial loop
In [17], an abstract framework for automatically generating loop invariants of imperative programs was proposed. This framework was then instantiated for the language of conjuncti...
Enric Rodríguez-Carbonell, Deepak Kapur
IFL
2003
Springer
144views Formal Methods» more  IFL 2003»
15 years 11 months ago
Building an Interface Between Eden and Maple: A Way of Parallelizing Computer Algebra Algorithms
Eden is a parallel functional language extending Haskell with processes. This paper describes the implementation of an interface between the Eden language and the Maple system. The...
Rafael Martínez, Ricardo Pena
GLVLSI
1996
IEEE
125views VLSI» more  GLVLSI 1996»
15 years 10 months ago
Performance-Driven Interconnect Global Routing
In this paper, we propose a global routing algorithm for multi-layer building-block layouts. The algorithm is based on successive ripup and rerouting while satisfying edge capacit...
Dongsheng Wang, Ernest S. Kuh
ICCAD
1996
IEEE
141views Hardware» more  ICCAD 1996»
15 years 10 months ago
An observability-based code coverage metric for functional simulation
Functional simulation is the most widely used method for design verification. At various levels of abstraction, e.g., behavioral, register-transfer level and gate level, the design...
Srinivas Devadas, Abhijit Ghosh, Kurt Keutzer