Sciweavers

5109 search results - page 678 / 1022
» On Learning Limiting Programs
Sort
View
MP
2010
116views more  MP 2010»
15 years 4 months ago
Separation algorithms for 0-1 knapsack polytopes
Valid inequalities for 0-1 knapsack polytopes often prove useful when tackling hard 0-1 Linear Programming problems. To generate such inequalities, one needs separation algorithms...
Konstantinos Kaparis, Adam N. Letchford
SAS
2010
Springer
262views Formal Methods» more  SAS 2010»
15 years 4 months ago
Concurrent Separation Logic for Pipelined Parallelization
Recent innovations in automatic parallelizing compilers are showing impressive speedups on multicore processors using shared memory with asynchronous channels. We have formulated a...
Christian J. Bell, Andrew W. Appel, David Walker
SIGOPS
2010
124views more  SIGOPS 2010»
15 years 4 months ago
Decoupling storage and computation in Hadoop with SuperDataNodes
The rise of ad-hoc data-intensive computing has led to the development of data-parallel programming systems such as Map/Reduce and Hadoop, which achieve scalability by tightly cou...
George Porter
MSV
2010
15 years 4 months ago
Simulating and Visualising Sedimentary Cluster-Cluster Aggregation
Recent simulations of diffusion limited cluster-cluster aggregation (DLCA) have shown systematic inhomogeneities in the shape and orientation of clusters formed when a sedimentary...
Ken A. Hawick
IANDC
2010
125views more  IANDC 2010»
15 years 3 months ago
A thread calculus with molecular dynamics
In a previous paper, we developed an algebraic theory of threads, interleaving of threads, and interaction between threads and services. In the current paper, we extend that theory...
Jan A. Bergstra, C. A. Middelburg