Sciweavers

346 search results - page 64 / 70
» Determinizing Asynchronous Automata
Sort
View
MANSCI
2007
139views more  MANSCI 2007»
13 years 10 months ago
A Market-Based Optimization Algorithm for Distributed Systems
In this paper, a market-based decomposition method for decomposable linear systems is developed. The solution process iterates between a master problem that solves the market-matc...
Zhiling Guo, Gary J. Koehler, Andrew B. Whinston
ESE
1998
131views Database» more  ESE 1998»
13 years 10 months ago
A Comparison of Tool-Based and Paper-Based Software Inspection
Software inspection is an e ective method of defect detection. Recent research activity has considered the development of tool support to further increase the e ciency and e ectiv...
F. MacDonald, J. Miller
SAC
2002
ACM
13 years 10 months ago
Statistical properties of the simulated time horizon in conservative parallel discrete-event simulations
We investigate the universal characteristics of the simulated time horizon of the basic conservative parallel algorithm when implemented on regular lattices. This technique [1, 2]...
G. Korniss, M. A. Novotny, A. K. Kolakowska, H. Gu...
INFOCOM
2010
IEEE
13 years 9 months ago
On Distributed Time-Dependent Shortest Paths over Duty-Cycled Wireless Sensor Networks
Abstract—We revisit the shortest path problem in asynchronous duty-cycled wireless sensor networks, which exhibit time-dependent features. We model the time-varying link cost and...
Shouwen Lai, Binoy Ravindran
SIGSOFT
2010
ACM
13 years 8 months ago
Realizability analysis for message-based interactions using shared-state projections
The global interaction behavior in message-based systems can be specified as a finite-state machine defining acceptable sequences of messages exchanged by a group of peers. Realiz...
Sylvain Hallé, Tevfik Bultan