Sciweavers

1068 search results - page 156 / 214
» For completeness, sublogarithmic space is no space
Sort
View
SPAA
2009
ACM
14 years 1 months ago
Brief announcement: a lower bound for depth-restricted work stealing
Work stealing is a common technique used in the runtime schedulers of parallel languages such as Cilk and parallel libraries such as Intel Threading Building Blocks (TBB). Depth-r...
Jim Sukha
DNA
2001
Springer
139views Bioinformatics» more  DNA 2001»
14 years 1 months ago
DNA Computing in Microreactors
Abstract. The goal of this research is to improve the programmability of DNA-based computers. Novel clockable microreactors can be connected in various ways to solve combinatorial ...
Danny van Noort, Frank-Ulrich Gast, John S. McCask...
SIGGRAPH
2010
ACM
14 years 1 months ago
Design and fabrication of materials with desired deformation behavior
This paper introduces a data-driven process for designing and fabricating materials with desired deformation behavior. Our process starts with measuring deformation properties of ...
Bernd Bickel, Moritz Bächer, Miguel A. Otaduy, Hy...
IEAAIE
2001
Springer
14 years 1 months ago
A Mixed Closure-CSP Method to Solve Scheduling Problems
Scheduling problems can be seen as a set of temporal metric and disjunctive constraints. So, they can be formulated in terms of CSPs techniques. In the literature, there are CSP-b...
María Isabel Alfonso Galipienso, Federico B...
DEXAW
2000
IEEE
88views Database» more  DEXAW 2000»
14 years 1 months ago
Spatio-Temporal Databases: Contentions, Components and Consolidation
Spatio-temporal databases have been the focus of considerable research activity over a significant period. However, there are as of yet very few prototypes of complete systems, f...
Norman W. Paton, Alvaro A. A. Fernandes, Tony Grif...