Sciweavers

2681 search results - page 469 / 537
» Problem F
Sort
View
SIGMOD
1998
ACM
97views Database» more  SIGMOD 1998»
14 years 1 months ago
Cost Based Query Scrambling for Initial Delays
Remote data access from disparate sources across a widearea network such as the Internet is problematic due to the unpredictable nature of the communications medium and the lack o...
Tolga Urhan, Michael J. Franklin, Laurent Amsaleg
SIGOPSE
1998
ACM
14 years 1 months ago
Nested Java processes: OS structure for mobile code
The majority of work on protection in single-language mobile code environments focuses on information security issues and depends on the language environment for solutions to the ...
Patrick Tullmann, Jay Lepreau
PLDI
2010
ACM
14 years 1 months ago
Detecting Inefficiently-Used Containers to Avoid Bloat
Runtime bloat degrades significantly the performance and scalability of software systems. An important source of bloat is the inefficient use of containers. It is expensive to cre...
Guoqing Xu, Atanas Rountev
STOC
1993
ACM
123views Algorithms» more  STOC 1993»
14 years 1 months ago
Constructing small sample spaces satisfying given constraints
Abstract. The subject of this paper is nding small sample spaces for joint distributions of n discrete random variables. Such distributions are often only required to obey a certa...
Daphne Koller, Nimrod Megiddo
STOC
1994
ACM
168views Algorithms» more  STOC 1994»
14 years 1 months ago
Fast algorithms for finding randomized strategies in game trees
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...
Daphne Koller, Nimrod Megiddo, Bernhard von Stenge...