Sciweavers

1993 search results - page 319 / 399
» On Action Theory Change
Sort
View
STOC
2001
ACM
115views Algorithms» more  STOC 2001»
14 years 10 months ago
Running time and program size for self-assembled squares
Recently Rothemund and Winfree 6] have considered the program size complexity of constructing squares by selfassembly. Here, we consider the time complexity of such constructions ...
Leonard M. Adleman, Qi Cheng, Ashish Goel, Ming-De...
OSDI
2008
ACM
14 years 10 months ago
From Optimization to Regret Minimization and Back Again
Internet routing is mostly based on static information-it's dynamicity is limited to reacting to changes in topology. Adaptive performance-based routing decisions would not o...
Ioannis C. Avramopoulos, Jennifer Rexford, Robert ...
PODS
2006
ACM
116views Database» more  PODS 2006»
14 years 10 months ago
Relational lenses: a language for updatable views
We propose a novel approach to the classical view update problem. The view update problem arises from the fact that modifications to a database view may not correspond uniquely to...
Aaron Bohannon, Benjamin C. Pierce, Jeffrey A. Vau...
SDM
2009
SIAM
191views Data Mining» more  SDM 2009»
14 years 7 months ago
Adaptive Concept Drift Detection.
An established method to detect concept drift in data streams is to perform statistical hypothesis testing on the multivariate data in the stream. Statistical decision theory off...
Anton Dries, Ulrich Rückert
TLDI
2009
ACM
142views Formal Methods» more  TLDI 2009»
14 years 7 months ago
Static extraction of sound hierarchical runtime object graphs
For many object-oriented systems, it is often useful to have a runtime architecture that shows networks of communicating objects. But it is hard to statically extract runtime obje...
Marwan Abi-Antoun, Jonathan Aldrich