Sciweavers

300 search results - page 45 / 60
» The Extension Theorem
Sort
View
JELIA
2004
Springer
14 years 23 days ago
Representation and Complexity in Boolean Games
Boolean games are a class of two-player games which may be defined via a Boolean form over a set of atomic actions. A particular game on some form is instantiated by partitioning ...
Paul E. Dunne, Wiebe van der Hoek
ARITH
2003
IEEE
14 years 21 days ago
SRT Division Algorithms as Dynamical Systems
SRT division, as it was discovered in the late 1950s represented an important improvement in the speed of division algorithms for computers at the time. A variant of SRT division ...
Mark McCann, Nicholas Pippenger
IPPS
1999
IEEE
13 years 11 months ago
A Formal Framework for Specifying and Verifying Time Warp Optimizations
Parallel and distributed systems are representative of large and complex systems that require the application of formal methods. These systems are often unreliable because implemen...
Victoria Chernyakhovsky, Peter Frey, Radharamanan ...
ISORC
2005
IEEE
14 years 1 months ago
Proof Slicing with Application to Model Checking Web Services
Web Services emerge as a new paradigm for distributed computing. Model checking is an important verification method to ensure the trustworthiness of composite WS. abstraction and...
Hai Huang, Wei-Tek Tsai, Raymond A. Paul
ICCAD
2002
IEEE
104views Hardware» more  ICCAD 2002»
14 years 4 months ago
A new enhanced SPFD rewiring algorithm
This paper presents an in-depth study of the theory and algorithms for the SPFD-based (Set of Pairs of Functions to be Distinguished) rewiring, and explores the flexibility in the...
Jason Cong, Joey Y. Lin, Wangning Long