Sciweavers

840 search results - page 144 / 168
» The Complexity of the Extended GCD Problem
Sort
View
STOC
2010
ACM
185views Algorithms» more  STOC 2010»
14 years 2 months ago
Measuring independence of datasets
Approximating pairwise, or k-wise, independence with sublinear memory is of considerable importance in the data stream model. In the streaming model the joint distribution is give...
Vladimir Braverman, Rafail Ostrovsky
SAIG
2000
Springer
14 years 1 months ago
On Jones-Optimal Specialization for Strongly Typed Languages
The phrase optimal program specialization" was de ned by Jones et al. in 1993 to capture the idea of a specializer being strong enough to remove entire layers of interpretatio...
Henning Makholm
KBSE
1995
IEEE
14 years 1 months ago
A Model for Decision Maintenance in the WinWin Collaboration Framework
Cost-effective engineering and evolution of complex software must involve the different stakeholders concurrently and collaboratively. The hard problem is providing computer suppo...
Prasanta K. Bose
ESM
1998
13 years 11 months ago
On Hybrid Combination of Queueing and Simulation
This paper aims to and illustrate that simulation and queuing theory can and should go hand in hand for a variety of practical problems, both in daily-life and industry, which are...
Nico M. van Dijk
AIPS
2009
13 years 11 months ago
Flexible Execution of Plans with Choice
Dynamic plan execution strategies allow an autonomous agent to respond to uncertainties while improving robustness and reducing the need for an overly conservative plan. Executive...
Patrick R. Conrad, Julie A. Shah, Brian C. William...