Sciweavers

116 search results - page 21 / 24
» Bounds for online bounded space hypercube packing
Sort
View
SMA
2009
ACM
185views Solid Modeling» more  SMA 2009»
15 years 4 months ago
A dynamic data structure for flexible molecular maintenance and informatics
We present the “Dynamic Packing Grid” (DPG) data structure along with details of our implementation and performance results, for maintaining and manipulating flexible molecul...
Chandrajit L. Bajaj, Rezaul Alam Chowdhury, Muhibu...
AIPS
2010
14 years 11 months ago
When Policies Can Be Trusted: Analyzing a Criteria to Identify Optimal Policies in MDPs with Unknown Model Parameters
Computing a good policy in stochastic uncertain environments with unknown dynamics and reward model parameters is a challenging task. In a number of domains, ranging from space ro...
Emma Brunskill
ICDE
2005
IEEE
118views Database» more  ICDE 2005»
15 years 10 months ago
Bypass Caching: Making Scientific Databases Good Network Citizens
Scientific database federations are geographically distributed and network bound. Thus, they could benefit from proxy caching. However, existing caching techniques are not suitabl...
Tanu Malik, Randal C. Burns, Amitabh Chaudhary
LCTRTS
1995
Springer
15 years 1 months ago
Scheduling of Hard Aperiodic Tasks in Hybrid Static/Dynamic Priority Systems
In this paper, we present a preemptive joint scheduling of hard deadline periodic and hard deadline aperiodic tasks on a uniprocessor real-time system. The scheduling has extended...
Jongwon Lee, Sungyoung Lee, Hyungill Kim
CADE
2001
Springer
15 years 9 months ago
Context Trees
Context trees are a popular and effective tool for tasks such as compression, sequential prediction, and language modeling. We present an algebraic perspective of context trees for...
Harald Ganzinger, Robert Nieuwenhuis, Pilar Nivela