Sciweavers

272 search results - page 21 / 55
» Communicating sequential processes for distributed constrain...
Sort
View
CONCUR
1997
Springer
15 years 3 months ago
Bounded Stacks, Bags and Queues
We prove that a bounded stack can be specified in process algebra with just the operators alternative and sequential composition and iteration. The bounded bag cannot be specified ...
Jos C. M. Baeten, Jan A. Bergstra
JSSPP
2001
Springer
15 years 4 months ago
Coscheduling under Memory Constraints in a NOW Environment
Networks of Workstations (NOW) have become important and cost-effective parallel platforms for scientific computations. In practice, a NOW system is heterogeneous and non-dedicat...
Francesc Giné, Francesc Solsona, Porfidio H...
GLOBECOM
2007
IEEE
15 years 6 months ago
Distributed Maximum Lifetime Routing in Wireless Sensor Networks Based on Regularization
— The maximum lifetime routing problem in wireless sensor networks has received increasing attention in recent years. One way is to formulate it as a linear programming problem b...
Vahid Shah-Mansouri, Vincent W. S. Wong
AGILEDC
2007
IEEE
15 years 6 months ago
Back to Basics: The Role of Agile Principles in Success with an Distributed Scrum Team
Agile processes rely on feedback and communication to work and they often work best with co-located teams for this reason. Sometimes agile makes sense because of project requireme...
Steve Berczuk
COORDINATION
2009
Springer
16 years 7 days ago
Assume-Guarantee Verification of Concurrent Systems
Process algebras are a set of mathematically rigourous languages with well defined semantics that permit modelling behaviour of concurrent and communicating systems. Verification o...
Liliana D'Errico, Michele Loreti