Sciweavers

9405 search results - page 249 / 1881
» Computing a Model of Set Theory
Sort
View
STOC
2001
ACM
115views Algorithms» more  STOC 2001»
16 years 6 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...

Lab
652views
17 years 5 months ago
Electronic Enterprises Laboratory
Our research is motivated by a strong conviction that business processes in electronic enterprises can be designed to deliver high levels of performance through the use of mathemat...
DAGSTUHL
2001
15 years 8 months ago
Constructive Foundations for Featherweight Java
In this paper we present a recursion-theoretic denotational semantics for Featherweight Java. Our interpretation is based on a formalization of the object model of Castagna, Ghelli...
Thomas Studer
ESCIENCE
2006
IEEE
15 years 10 months ago
Toward Standards for Integration of Instruments into Grid Computing Environments
Instruments and sensors are the primary sources of data driving science and the development and refinement of theory. A critical component of eresearch yet to be clarified is the ...
Donald F. McMullen, Ian M. Atkinson, Kenneth Chiu,...
FCS
2006
15 years 8 months ago
Algorithmic Control in Concurrent Computations
: In this paper, functioning and interaction of distributed devices and concurrent algorithms are analyzed in the context of the theory of algorithms. Although different systems in...
Mark Burgin