Sciweavers

291 search results - page 7 / 59
» Liveness-Preserving Atomicity Abstraction
Sort
View
OPODIS
2004
14 years 11 months ago
Lock-Free and Practical Doubly Linked List-Based Deques Using Single-Word Compare-and-Swap
Abstract. We present an efficient and practical lock-free implementation of a concurrent deque that supports parallelism for disjoint accesses and uses atomic primitives which are ...
Håkan Sundell, Philippas Tsigas
LPNMR
1999
Springer
15 years 1 months ago
Annotated Revision Programs
Abstract. Revision programming was introduced as a formalism to describe and enforce updates of belief sets and databases. Revision programming was extended by Fitting who assigned...
V. Wiktor Marek, Inna Pivkina, Miroslaw Truszczyns...
CIE
2007
Springer
15 years 1 months ago
Definability in the Homomorphic Quasiorder of Finite Labeled Forests
Abstract. We prove that for any k 3 each element of the homomorphic quasiorder of finite k-labeled forests is definable, provided that the minimal non-smallest elements are allowe...
Oleg V. Kudinov, Victor L. Selivanov
ICML
1999
IEEE
15 years 10 months ago
Abstracting from Robot Sensor Data using Hidden Markov Models
ing from Robot Sensor Data using Hidden Markov Models Laura Firoiu, Paul Cohen Computer Science Department, LGRC University of Massachusetts at Amherst, Box 34610 Amherst, MA 01003...
Laura Firoiu, Paul R. Cohen
ICDE
2008
IEEE
214views Database» more  ICDE 2008»
15 years 11 months ago
Adjourn State Concurrency Control Avoiding Time-Out Problems in Atomic Commit Protocols
Abstract-- The use of atomic commit protocols in mobile adhoc networks involves difficulties in setting up reasonable timeouts for aborting a pending distributed transaction. This ...
George Samaras, Martin Hett, Panos K. Chrysanthis,...