Sciweavers

1960 search results - page 216 / 392
» The Logic of Large Enough
Sort
View
CAISE
2007
Springer
14 years 2 months ago
Specification and Verification of Authorization Policies for Web Services Composition
The management and maintenance of a large number of Web services is not easy and, in particular, needs appropriate authorization policies to be defined so as to realize reliable an...
Mohsen Rouached, Claude Godart
DAGSTUHL
2007
14 years 5 days ago
Parallelism through Digital Circuit Design
Abstract. Two ways to exploit chips with a very large number of transistors are multicore processors and programmable logic chips. Some data parallel algorithms can be executed eï¬...
John O'Donnell
IWSEC
2010
Springer
13 years 8 months ago
Efficient Secure Auction Protocols Based on the Boneh-Goh-Nissim Encryption
This paper presents efficient secure auction protocols for first price auction and second price auction. Previous auction protocols are based on a generally secure multi-party prot...
Takuho Mitsunaga, Yoshifumi Manabe, Tatsuaki Okamo...
ICLP
2009
Springer
14 years 11 months ago
One More Decidable Class of Finitely Ground Programs
When a logic program is processed by an answer set solver, the first task is to generate its instantiation. In a recent paper, Calimeri et el. made the idea of efficient instantiat...
Yuliya Lierler, Vladimir Lifschitz
VLSID
2005
IEEE
116views VLSI» more  VLSID 2005»
14 years 11 months ago
A Quasi-Delay-Insensitive Method to Overcome Transistor Variation
Synchronous design methods have intrinsic performance overheads due to their use of the global clock and timing assumptions. In future manufacturing processes not only may it beco...
C. Brej, Jim D. Garside