Sciweavers

804 search results - page 107 / 161
» On the Termination of the Chase Algorithm
Sort
View
INFOCOM
2005
IEEE
15 years 6 months ago
Asymptotically optimal transmission policies for low-power wireless sensor networks
— We consider wireless sensor networks with multiple gateways and multiple classes of traffic carrying data generated by different sensory inputs. The objective is to devise joi...
Ioannis Ch. Paschalidis, Wei Lai, David Starobinsk...
114
Voted
KBSE
2005
IEEE
15 years 6 months ago
Learning to verify branching time properties
We present a new model checking algorithm for verifying computation tree logic (CTL) properties. Our technique is based on using language inference to learn the fixpoints necessar...
Abhay Vardhan, Mahesh Viswanathan
110
Voted
ASPDAC
2005
ACM
73views Hardware» more  ASPDAC 2005»
15 years 6 months ago
An-OARSMan: obstacle-avoiding routing tree construction with good length performance
- Routing is one of the important steps in VLSI/ULSI physical design. The rectilinear Steiner minimum tree (RSMT) construction is an essential part of routing. Since macro cells, I...
Yu Hu, Tong Jing, Xianlong Hong, Zhe Feng 0002, Xi...
PRICAI
2000
Springer
15 years 4 months ago
Generating Hierarchical Structure in Reinforcement Learning from State Variables
This paper presents the CQ algorithm which decomposes and solves a Markov Decision Process (MDP) by automatically generating a hierarchy of smaller MDPs using state variables. The ...
Bernhard Hengst
TACAS
2000
Springer
151views Algorithms» more  TACAS 2000»
15 years 4 months ago
Salsa: Combining Constraint Solvers with BDDs for Automatic Invariant Checking
Salsa is an invariant checker for speci cations in SAL the SCR Abstract Language. To establish a formula as an invariant without any user guidance Salsa carries out an induction pr...
Ramesh Bharadwaj, Steve Sims