3378 search results - page 297 / 676 » A universe of binding and computation |
175
click to vote
DAC
2008
ACM
16 years 7 months ago
2008
ACM
ng Automatic Abstraction Refinement for Generalized Symbolic Trajectory Evaluation Yan Chen Dept. of Computer Science Portland State University Portland, OR, 97207 chenyan@cs.pdx.e...
171
click to vote
DAC
2001
ACM
16 years 7 months ago
2001
ACM
An approach for factoring general boolean functions was described in [15, 16] which is based on graph partitioning algorithms. In this paper, we present a very fast algorithm for ...
161
click to vote
ICPADS
2008
IEEE
16 years 1 months ago
2008
IEEE
We propose the design of Plug, an application to find and keep contacts with friends within many inter-connected 3D virtual worlds. Users use an instant messenger (IM)-like inter...
177
click to vote
GRC
2007
IEEE
16 years 1 months ago
2007
IEEE
The original rough set model is concerned primarily with the approximation of sets described by single binary relation on the universe. In the view of granular computing, classica...
152
click to vote
ICDCS
2006
IEEE
16 years 25 days ago
2006
IEEE
Despite the large amount of Byzantine fault-tolerant algorithms for message-passing systems designed through the years, only recently algorithms for the coordination of processes ...