Sciweavers

1690 search results - page 149 / 338
» Algorithmic Properties of Millstream Systems
Sort
View
135
Voted
IEEESCC
2007
IEEE
15 years 11 months ago
A Service Discovery Framework based on Linear Composition
Service discovery has been recognised as an important aspect of service oriented computing. This is even more the case when developing service centric systems in which software sy...
Andrea Zisman, Khaled Mahbub, George Spanoudakis
APN
2005
Springer
15 years 10 months ago
Continuization of Timed Petri Nets: From Performance Evaluation to Observation and Control
State explosion is a fundamental problem in the analysis and synthesis of discrete event systems. Continuous Petri nets can be seen as a relaxation of discrete models allowing more...
Manuel Silva, Laura Recalde
PODC
2009
ACM
15 years 11 months ago
Fast scalable deterministic consensus for crash failures
We study communication complexity of consensus in synchronous message-passing systems with processes prone to crashes. The goal in the consensus problem is to have all the nonfaul...
Bogdan S. Chlebus, Dariusz R. Kowalski, Michal Str...
SIAMREV
2010
174views more  SIAMREV 2010»
14 years 11 months ago
Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
The affine rank minimization problem consists of finding a matrix of minimum rank that satisfies a given system of linear equality constraints. Such problems have appeared in the ...
Benjamin Recht, Maryam Fazel, Pablo A. Parrilo
ICFP
1997
ACM
15 years 8 months ago
A Modular, Polyvariant, and Type-Based Closure Analysis
We observe that the principal typing property of a type system is the enabling technology for modularity and separate compilation [10]. We use this technology to formulate a modul...
Anindya Banerjee