Sciweavers

455 search results - page 46 / 91
» Asynchronous and deterministic objects
Sort
View
AUTOMATICA
2006
85views more  AUTOMATICA 2006»
13 years 8 months ago
Stability analysis of network-based cooperative resource allocation strategies
Resource allocation involves deciding how to divide a resource of limited availability among multiple demands in a way that optimizes current objectives. In this brief paper we fo...
Alvaro E. Gil, Kevin M. Passino
CEC
2010
IEEE
13 years 9 months ago
An analysis of massively distributed evolutionary algorithms
Computational science is placing new demands on optimization algorithms as the size of data sets and the computational complexity of scientific models continue to increase. As thes...
Travis J. Desell, David P. Anderson, Malik Magdon-...
SYNASC
2005
IEEE
86views Algorithms» more  SYNASC 2005»
14 years 1 months ago
One and Two Polarizations, Membrane Creation and Objects Complexity in P Systems
We improve, by using register machines, some existing universality results for specific models of P systems. P systems with membrane creation are known to generate all recursivel...
Artiom Alhazov, Rudolf Freund, Agustin Riscos-N&ua...
ANOR
2008
69views more  ANOR 2008»
13 years 8 months ago
Scheduling vessels and container-yard operations with conflicting objectives
Abstract We consider the problem of coordinating the operations of two supply chain partners: a foreign shipping company and a domestic port. The two partners have conflicting busi...
Endre Boros, Lei Lei, Yao Zhao, Hua Zhong
STOC
1997
ACM
91views Algorithms» more  STOC 1997»
14 years 4 days ago
Lower Bounds for Distributed Coin-Flipping and Randomized Consensus
We examine a class of collective coin- ipping games that arises from randomized distributed algorithms with halting failures. In these games, a sequence of local coin ips is gener...
James Aspnes