Sciweavers

686 search results - page 131 / 138
» Foundations for Bidirectional Programming
Sort
View
RTSS
1999
IEEE
15 years 1 months ago
High-Level Modeling and Analysis of TCAS
In this paper, we demonstrate a high-level approach to modeling and analyzing complex safety-critical systems through a case study in the area of air traffic management. In partic...
Carolos Livadas, John Lygeros, Nancy A. Lynch
FOCS
1998
IEEE
15 years 1 months ago
The Complexity of Acyclic Conjunctive Queries
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
Georg Gottlob, Nicola Leone, Francesco Scarcello
HPCA
1996
IEEE
15 years 1 months ago
A Comparison of Entry Consistency and Lazy Release Consistency Implementations
This paper compares several implementations of entry consistency (EC) and lazy release consistency (LRC), two relaxed memory models in use with software distributed shared memory ...
Sarita V. Adve, Alan L. Cox, Sandhya Dwarkadas, Ra...
108
Voted
SIGIR
1993
ACM
15 years 1 months ago
Development of a Modern OPAC: From REVTOLC to MARIAN
Since 1986 we have investigated the problems and possibilities of applying modern information retrieval methods to large online public access library catalogs (OPACs). In the Retr...
Edward A. Fox, Robert K. France, Eskinder Sahle, A...
STOC
1994
ACM
168views Algorithms» more  STOC 1994»
15 years 1 months ago
Fast algorithms for finding randomized strategies in game trees
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...
Daphne Koller, Nimrod Megiddo, Bernhard von Stenge...