Sciweavers

113 search results - page 6 / 23
» What can the GC compute efficiently
Sort
View
CAP
2010
14 years 11 months ago
Parallel disk-based computation for large, monolithic binary decision diagrams
Binary Decision Diagrams (BDDs) are widely used in formal verification. They are also widely known for consuming large amounts of memory. For larger problems, a BDD computation wi...
Daniel Kunkle, Vlad Slavici, Gene Cooperman
ITS
2010
Springer
168views Multimedia» more  ITS 2010»
15 years 9 months ago
Computational Workflows for Assessing Student Learning
The use of technology for instruction, and the enormous amount of information available for consumption, places a considerable burden on instructors who must learn to integrate app...
Jun Ma, Erin Shaw, Jihie Kim
IJAR
2006
125views more  IJAR 2006»
15 years 4 months ago
Computing best-possible bounds for the distribution of a sum of several variables is NP-hard
In many real-life situations, we know the probability distribution of two random variables x1 and x2, but we have no information about the correlation between x1 and x2; what are ...
Vladik Kreinovich, Scott Ferson
MOBIHOC
2008
ACM
16 years 3 months ago
The capacity and energy efficiency of wireless ad hoc networks with multi-packet reception
We address the cost incurred in increasing the transport capacity of wireless ad hoc networks over what can be attained when sources and destinations communicate over multi-hop pa...
Zheng Wang, Hamid R. Sadjadpour, Jose Joaquin Garc...
CCS
2000
ACM
15 years 7 months ago
PRUNES: an efficient and complete strategy for automated trust negotiation over the Internet
The Internet provides an environment where two parties, who are virtually strangers to each other, can make connections and do business together. Before any actual business starts...
Ting Yu, Xiaosong Ma, Marianne Winslett