Sciweavers

8109 search results - page 1204 / 1622
» A Model of Component-Based Programming
Sort
View
JLP
2008
121views more  JLP 2008»
15 years 4 months ago
A process algebraic view of shared dataspace coordination
Coordination languages were introduced in the early 80's as programming notations to manage the interaction among concurrent collaborating software entities. Process algebras...
Nadia Busi, Gianluigi Zavattaro
STTT
2010
97views more  STTT 2010»
15 years 4 months ago
Distributed dynamic partial order reduction
Abstract. Runtime (dynamic) model checking is a promising verification methodology for real-world threaded software because of its many features, the prominent ones being: (i) it ...
Yu Yang, Xiaofang Chen, Ganesh Gopalakrishnan, Rob...
145
Voted
TALG
2010
74views more  TALG 2010»
15 years 4 months ago
Comparison-based time-space lower bounds for selection
We establish the first nontrivial lower bounds on timespace tradeoffs for the selection problem. We prove that any comparison-based randomized algorithm for finding the median ...
Timothy M. Chan
ATMOS
2010
169views Optimization» more  ATMOS 2010»
15 years 4 months ago
Traffic Signal Optimization Using Cyclically Expanded Networks
Traditionally, the coordination of multiple traffic signals and the traffic assignment problem in an urban street network are considered as two separate optimization problems. How...
Ekkehard Köhler, Martin Strehler
CLOUDCOM
2010
Springer
15 years 4 months ago
Evaluation of MapReduce for Gridding LIDAR Data
-- The MapReduce programming model, introduced by Google, has become popular over the past few years as a mechanism for processing large amounts of data, using sharednothing parall...
Sriram Krishnan, Chaitanya K. Baru, Christopher J....
« Prev « First page 1204 / 1622 Last » Next »