Sciweavers

TACAS
1999
Springer
88views Algorithms» more  TACAS 1999»
14 years 3 months ago
A Theorem Prover-Based Analysis Tool for Object-Oriented Databases
We present a theorem-prover based analysis tool for object-oriented database systems with integrity constraints. Object-oriented database specifications are mapped to higher-order...
David Spelt, Susan Even
TACAS
1999
Springer
109views Algorithms» more  TACAS 1999»
14 years 3 months ago
An Easily Extensible Toolset for Tabular Mathematical Expressions
David Lorge Parnas, Dennis K. Peters
TACAS
1999
Springer
92views Algorithms» more  TACAS 1999»
14 years 3 months ago
Fighting Livelock in the i-Protocol: A Comparative Study of Verification Tools
Yifei Dong, Xiaoqun Du, Y. S. Ramakrishna, C. R. R...
IPPS
1998
IEEE
14 years 3 months ago
Nearly Optimal Algorithms for Broadcast on d-Dimensional All-Port and Wormhole-Routed Torus
In this paper, we present nearly optimal algorithms for broadcast on a d-dimensional nn:::n torus that supports all-port communication and wormhole routing. Let Tn denote the numb...
Jyh-Jong Tsay, Wen-Tsong Wang
TACAS
1999
Springer
81views Algorithms» more  TACAS 1999»
14 years 3 months ago
Process Algebra in PVS
The aim of this work is to investigate mechanical support for process algebra, both for concrete applications and theoretical properties. Two approaches are presented using the ver...
Twan Basten, Jozef Hooman
TACAS
1999
Springer
95views Algorithms» more  TACAS 1999»
14 years 3 months ago
Symbolic Model Checking without BDDs
Armin Biere, Alessandro Cimatti, Edmund M. Clarke,...
IPPS
1998
IEEE
14 years 3 months ago
Benchmarking the Task Graph Scheduling Algorithms
The problem of scheduling a weighted directed acyclic graph (DAG) to a set of homogeneous processors to minimize the completion time has been extensively studied. The NPcompletene...
Yu-Kwong Kwok, Ishfaq Ahmad
IPPS
1998
IEEE
14 years 3 months ago
An O((log log n)2) Time Convex Hull Algorithm on Reconfigurable Meshes
It was open for more than eight years to obtain an algorithm for computing the convex hull of a set of n sorted points in sub-logarithmic time on a reconfigurable mesh of size pn ...
Tatsuya Hayashi, Koji Nakano, Stephan Olariu
KDD
1999
ACM
217views Data Mining» more  KDD 1999»
14 years 3 months ago
An Efficient Algorithm to Update Large Itemsets with Early Pruning
We present an efficient algorithm (UWEP) for updating large itemsets when new transactions are added to the set of old transactions. UWEP employs a dynamic lookahead strategy in u...
Necip Fazil Ayan, Abdullah Uz Tansel, M. Erol Arku...
ISAAC
1999
Springer
107views Algorithms» more  ISAAC 1999»
14 years 3 months ago
Carrying Umbrellas: An Online Relocation Problem on Graphs
We introduce an online relocation problem on a graph, in which a player who walks around the nodes makes decisions on whether to relocate mobile resources, while not knowing the fu...
Jae-Ha Lee, Chong-Dae Park, Kyung-Yong Chwa