Sciweavers

1523 search results - page 185 / 305
» Partially ordered secretaries
Sort
View
115
Voted
OOPSLA
2007
Springer
15 years 7 months ago
Scalable omniscient debugging
Omniscient debuggers make it possible to navigate backwards in time within a program execution trace, drastically improving the task of debugging complex applications. Still, they...
Guillaume Pothier, Éric Tanter, José...
SIGMOD
1998
ACM
97views Database» more  SIGMOD 1998»
15 years 5 months ago
Cost Based Query Scrambling for Initial Delays
Remote data access from disparate sources across a widearea network such as the Internet is problematic due to the unpredictable nature of the communications medium and the lack o...
Tolga Urhan, Michael J. Franklin, Laurent Amsaleg
ICLP
2010
Springer
15 years 4 months ago
Bisimilarity in Concurrent Constraint Programming
Abstract. In this doctoral work we aim at developing a new approach to labelled semantics and equivalences for the Concurrent Constraint Programming (CCP) which will enable a broad...
Andres A. Aristizabal P.
SODA
2008
ACM
104views Algorithms» more  SODA 2008»
15 years 2 months ago
Fast and reliable reconstruction of phylogenetic trees with very short edges
Abstract Ilan Gronau Shlomo Moran Sagi Snir Phylogenetic reconstruction is the problem of reconstructing an evolutionary tree from sequences corresponding to leaves of that tree. ...
Ilan Gronau, Shlomo Moran, Sagi Snir
113
Voted
DS
1992
128views Database» more  DS 1992»
15 years 2 months ago
Achieving Incremental Consistency among Autonomous Replicated Databases
In this paper, we present methods for supporting autonomous updates in replicated databases. Autonomous updates are of particular importance to applications that cannot tolerate t...
Stefano Ceri, Maurice A. W. Houtsma, Arthur M. Kel...