Sciweavers

14161 search results - page 2688 / 2833
» On generalized middle-level problem
Sort
View
ESOP
2004
Springer
15 years 9 months ago
Resources, Concurrency, and Local Reasoning (Abstract)
t) Peter W. O’Hearn Queen Mary, University of London In the 1960s Dijkstra suggested that, in order to limit the complexity of potential process interactions, concurrent programs...
Peter W. O'Hearn
ICALP
2004
Springer
15 years 9 months ago
The Black-Box Complexity of Nearest Neighbor Search
We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...
Robert Krauthgamer, James R. Lee
ICCS
2004
Springer
15 years 9 months ago
Petri Nets as Executable Specifications of High-Level Timed Parallel Systems
We propose to use high-level Petri nets as a model for the semantics of high-level parallel systems. This model is known to be useful for the purpose of verification and we show t...
Franck Pommereau
ICSOC
2004
Springer
15 years 9 months ago
Associating assertions with business processes and monitoring their execution
Business processes that span organizational borders describe the interaction between multiple parties working towards a common objective. They also express business rules that gov...
Alexander Lazovik, Marco Aiello, Mike P. Papazoglo...
IPSN
2004
Springer
15 years 9 months ago
Lattice sensor networks: capacity limits, optimal routing and robustness to failures
We study network capacity limits and optimal routing algorithms for regular sensor networks, namely, square and torus grid sensor networks, in both, the static case (no node failu...
Guillermo Barrenechea, Baltasar Beferull-Lozano, M...
« Prev « First page 2688 / 2833 Last » Next »