Sciweavers

434 search results - page 77 / 87
» A Distributed and Probabilistic Concurrent Constraint Progra...
Sort
View
DMSN
2008
ACM
13 years 9 months ago
Stream-based macro-programming of wireless sensor, actuator network applications with SOSNA
Wireless sensor, actuator networks (WSANs) distinguish themselves from wireless sensor networks by the need to coordinate actuators' actions, real-time constraints on communi...
Marcin Karpinski, Vinny Cahill
STOC
2004
ACM
150views Algorithms» more  STOC 2004»
14 years 8 months ago
Typical properties of winners and losers in discrete optimization
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
René Beier, Berthold Vöcking
JPDC
2008
122views more  JPDC 2008»
13 years 7 months ago
Stochastic robustness metric and its use for static resource allocations
This research investigates the problem of robust static resource allocation for distributed computing systems operating under imposed Quality of Service (QoS) constraints. Often, ...
Vladimir Shestak, Jay Smith, Anthony A. Maciejewsk...
ICGI
2010
Springer
13 years 6 months ago
Learning PDFA with Asynchronous Transitions
In this paper we extend the PAC learning algorithm due to Clark and Thollard for learning distributions generated by PDFA to automata whose transitions may take varying time length...
Borja Balle, Jorge Castro, Ricard Gavaldà
CORR
2008
Springer
116views Education» more  CORR 2008»
13 years 7 months ago
Binding bigraphs as symmetric monoidal closed theories
Milner's bigraphs [1] are a general framework for reasoning about distributed and concurrent programming languages. Notably, it has been designed to encompass both the -calcul...
Tom Hirschowitz, Aurélien Pardon