Sciweavers

522 search results - page 45 / 105
» Necessary but Not Sufficient
Sort
View
FAST
2009
13 years 5 months ago
Minuet: Rethinking Concurrency Control in Storage Area Networks
Clustered applications in storage area networks (SANs), widely adopted in enterprise datacenters, have traditionally relied on distributed locking protocols to coordinate concurre...
Andrey Ermolinskiy, Daekyeong Moon, Byung-Gon Chun...
AI
2006
Springer
13 years 7 months ago
On the computational complexity of coalitional resource games
We study Coalitional Resource Games (CRGs), a variation of Qualitative Coalitional Games (QCGs) in which each agent is endowed with a set of resources, and the ability of a coalit...
Michael Wooldridge, Paul E. Dunne
AAECC
2006
Springer
132views Algorithms» more  AAECC 2006»
13 years 7 months ago
The Conjugacy Search Problem in Public Key Cryptography: Unnecessary and Insufficient
The conjugacy search problem in a group G is the problem of recovering an x G from given g G and h = x-1 gx. This problem is in the core of several recently suggested public key ...
Vladimir Shpilrain, Alexander Ushakov
ASYNC
1997
IEEE
103views Hardware» more  ASYNC 1997»
13 years 11 months ago
Efficient Timing Analysis Algorithms for Timed State Space Exploration
This paper presents new timing analysis algorithms for efficient state space exploration during timed circuit synthesis. Timed circuits are a class of asynchronous circuits that i...
Wendy Belluomini, Chris J. Myers
SDL
2001
73views Hardware» more  SDL 2001»
13 years 9 months ago
HyperMSCs with Connectors for Advanced Visual System Modelling and Testing
Experiences with the use of the MSC language for complex system specifications have shown that certain extensions are necessary in order to arrive at sufficiently transparent and m...
Jens Grabowski, Peter Graubmann, Ekkart Rudolph