Sciweavers

1055 search results - page 76 / 211
» Enumerations in computable structure theory
Sort
View
ICPP
2008
IEEE
15 years 4 months ago
On Clustering Tasks in IC-Optimal Dags
Strategies are developed for “fattening” the tasks of computation-dags so as to accommodate the heterogeneity of remote clients in Internet-based computing (IC). Earlier work ...
Mark Sims, Gennaro Cordasco, Arnold L. Rosenberg
POPL
2008
ACM
15 years 10 months ago
Imperative self-adjusting computation
Self-adjusting computation enables writing programs that can automatically and efficiently respond to changes to their data (e.g., inputs). The idea behind the approach is to stor...
Umut A. Acar, Amal Ahmed, Matthias Blume
DNA
2006
Springer
146views Bioinformatics» more  DNA 2006»
15 years 1 months ago
On Times to Compute Shapes in 2D Tile Self-assembly
We study the times to grow structures within the tile self-assembly model proposed by Winfree, and the possible shapes that can be achieved. Our earlier work was confined to the g...
Yuliy M. Baryshnikov, Edward G. Coffman Jr., Boons...
ACL
2010
14 years 7 months ago
A Probabilistic Generative Model for an Intermediate Constituency-Dependency Representation
We present a probabilistic model extension to the Tesni`ere Dependency Structure (TDS) framework formulated in (Sangati and Mazza, 2009). This representation incorporates aspects ...
Federico Sangati

Lecture Notes
2225views
16 years 8 months ago
Microeconomics
The main objective of the course is for students to be able to analyze problems in microeconomic theory at the beginning graduate level. Students successfully completing the course...
Arne Hallam