Sciweavers

1415 search results - page 233 / 283
» List making in the home
Sort
View
ASYNC
2000
IEEE
122views Hardware» more  ASYNC 2000»
15 years 4 months ago
DUDES: A Fault Abstraction and Collapsing Framework for Asynchronous Circuits
Fault Abstraction and Collapsing Framework for Asynchronous Circuits Philip P. Shirvani, Subhasish Mitra Center for Reliable Computing Stanford University Stanford, CA Jo C. Eberge...
Philip P. Shirvani, Subhasish Mitra, Jo C. Ebergen...
SIGCSE
2000
ACM
453views Education» more  SIGCSE 2000»
15 years 4 months ago
Aristotle and object-oriented programming: why modern students need traditional logic
Classifying is a central activity in object-oriented programming and distinguishes it from procedural programming. Traditional logic, initiated by Aristotle, assigns classificatio...
Derek Rayside, Gerard T. Campbell
CRYPTO
2000
Springer
149views Cryptology» more  CRYPTO 2000»
15 years 4 months ago
A Cryptographic Solution to a Game Theoretic Problem
In this work we use cryptography to solve a game-theoretic problem which arises naturally in the area of two party strategic games. The standard game-theoretic solution concept for...
Yevgeniy Dodis, Shai Halevi, Tal Rabin
COMPUTE
2010
ACM
15 years 4 months ago
Mining periodic-frequent patterns with maximum items' support constraints
The single minimum support (minsup) based frequent pattern mining approaches like Apriori and FP-growth suffer from“rare item problem”while extracting frequent patterns. That...
R. Uday Kiran, P. Krishna Reddy
ICPP
1999
IEEE
15 years 4 months ago
Multi-Capacity Bin Packing Algorithms with Applications to Job Scheduling under Multiple Constraints
In past massively parallel processing systems, such as the TMC CM-5 and the CRI T3E, the scheduling problem consisted of allocating a single type of resource among the waiting job...
William Leinberger, George Karypis, Vipin Kumar