Sciweavers

224 search results - page 24 / 45
» Auctions with Severely Bounded Communication
Sort
View
HPDC
2003
IEEE
14 years 21 days ago
Trace-Based Simulations of Processor Co-Allocation Policies in Multiclusters
In systems consisting of multiple clusters of processors which employ space sharing for scheduling jobs, such as our Distributed ASCI1 Supercomputer (DAS), coallocation, i.e., the...
Anca I. D. Bucur, Dick H. J. Epema
IFIPTCS
2000
13 years 11 months ago
Real-Time Language Recognition by Alternating Cellular Automata
The capabilities of alternating cellular automata (ACA) to accept formal languages are investigated. Several notions of alternation in cellular automata have been proposed. Here we...
Thomas Buchholz, Andreas Klein, Martin Kutrib
ATVA
2007
Springer
101views Hardware» more  ATVA 2007»
13 years 11 months ago
On-the-Fly Model Checking of Fair Non-repudiation Protocols
A fair non-repudiation protocol should guarantee, (1) when a sender sends a message to a receiver, neither the sender nor the receiver can deny having participated in this communic...
Guoqiang Li, Mizuhito Ogawa
JSAC
2010
98views more  JSAC 2010»
13 years 2 months ago
Task allocation for networked autonomous underwater vehicles in critical missions
Underwater Acoustic Sensor Networks (UW-ASNs) consist of stationary or mobile nodes such as Autonomous Underwater Vehicles (AUVs), which may be classified as propellerdriven vehicl...
Indraneel S. Kulkarni, Dario Pompili
GLOBECOM
2008
IEEE
14 years 1 months ago
Time Dependent Message Spraying for Routing in Intermittently Connected Networks
—Intermittently connected mobile networks, also called Delay Tolerant Networks (DTNs), are wireless networks in which at any given time instance, the probability of having a comp...
Eyuphan Bulut, Zijian Wang, Boleslaw K. Szymanski