6365 search results - page 1246 / 1273 » Fast Local Computation Algorithms |
ICFP
1999
ACM
15 years 2 months ago
1999
ACM
Deforestation optimises a functional program by transforming it into another one that does not create certain intermediate data structures. Short cut deforestation is a deforestat...
APLAS
2007
ACM
15 years 1 months ago
2007
ACM
Abstract. Given the combinatorial nature of cellular signalling pathways, where biological agents can bind and modify each other in a large number of ways, concurrent or agent-base...
CC
2006
Springer
15 years 1 months ago
2006
Springer
The polyhedral model is known to be a powerful framework to reason about high level loop transformations. Recent developments in optimizing compilers broke some generally accepted ...
CGO
2006
IEEE
15 years 1 months ago
2006
IEEE
Modern computer systems are called on to deal with billions of events every second, whether they are instructions executed, memory locations accessed, or packets forwarded. This p...
180
click to vote
NLP
2000
15 years 1 months ago
2000
Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...