Sciweavers

675 search results - page 132 / 135
» Using Fairness to Make Abstractions Work
Sort
View
WISE
2005
Springer
15 years 3 months ago
Scalable Instance Retrieval for the Semantic Web by Approximation
Abstract. Approximation has been identified as a potential way of reducing the complexity of logical reasoning. Here we explore approximation for speeding up instance retrieval in...
Holger Wache, Perry Groot, Heiner Stuckenschmidt
WDAG
2005
Springer
104views Algorithms» more  WDAG 2005»
15 years 3 months ago
Polymorphic Contention Management
Abstract. In software transactional memory (STM) systems, a contention manager resolves conflicts among transactions accessing the same memory locations. Whereas atomicity and ser...
Rachid Guerraoui, Maurice Herlihy, Bastian Pochon
ISSTA
2004
ACM
15 years 2 months ago
Optimal strategies for testing nondeterministic systems
This paper deals with testing of nondeterministic software systems. We assume that a model of the nondeterministic system is given by a directed graph with two kind of vertices: s...
Lev Nachmanson, Margus Veanes, Wolfram Schulte, Ni...
97
Voted
BIRTHDAY
2004
Springer
15 years 2 months ago
A Trace Semantics for Long-Running Transactions
Abstract. A long-running transaction is an interactive component of a distributed system which must be executed as if it were a single atomic action. In principle, it should not be...
Michael J. Butler, C. A. R. Hoare, Carla Ferreira
WAPCV
2004
Springer
15 years 2 months ago
Towards a Biologically Plausible Active Visual Search Model
Abstract. This paper proposes a neuronal-based solution to active visual search, that is, visual search for a given target in displays that are too large in spatial extent to be in...
Andrei Zaharescu, Albert L. Rothenstein, John K. T...