Sciweavers

398 search results - page 23 / 80
» Tuning P Systems for Solving the Broadcasting Problem
Sort
View
WDAG
1997
Springer
106views Algorithms» more  WDAG 1997»
15 years 1 months ago
Performing Tasks on Restartable Message-Passing Processors
Abstract. This work presents new algorithms for the "Do-All" problem that consists of performing t tasks reliably in a message-passing synchronous system of p fault-prone...
Bogdan S. Chlebus, Roberto De Prisco, Alexander A....
ATAL
2008
Springer
14 years 11 months ago
Playing games for security: an efficient exact algorithm for solving Bayesian Stackelberg games
In a class of games known as Stackelberg games, one agent (the leader) must commit to a strategy that can be observed by the other agent (the follower or adversary) before the adv...
Praveen Paruchuri, Jonathan P. Pearce, Janusz Mare...
ASAP
2003
IEEE
114views Hardware» more  ASAP 2003»
15 years 2 months ago
An Efficient Disk-Array-Based Server Design for a Multicast Video Streaming System
Recently, a number of researchers have started to investigate new video-on-demand (VoD) architectures using batching, patching and periodic broadcasting. These architectures, comp...
P. H. Chan Patton, Jack Y. B. Lee
62
Voted
ICDCS
2007
IEEE
15 years 4 months ago
Distributed Slicing in Dynamic Systems
Peer to peer (P2P) systems are moving from application specific architectures to a generic service oriented design philosophy. This raises interesting problems in connection with...
Antonio Fernández, Vincent Gramoli, Ernesto...
AICCSA
2006
IEEE
95views Hardware» more  AICCSA 2006»
15 years 3 months ago
DEPICT: A High-Level Formal Language For Modeling Constraint Satisfaction Problems
: The past decade witnessed rapid development of constraint satisfaction technologies, where algorithms are now able to cope with larger and harder problems. However, owing to the ...
Abdulwahed M. Abbas, Edward P. K. Tsang, Ahmad H. ...