Sciweavers

1569 search results - page 56 / 314
» Programming contest strategy
Sort
View
TJS
2002
83views more  TJS 2002»
15 years 2 months ago
An I/O-Conscious Tiling Strategy for Disk-Resident Data Sets
This paper describes a tiling technique that can be used by application programmers and optimizing compilers to obtain I/O-efficient versions of regular scientific loop nests. Due ...
Mahmut T. Kandemir, Alok N. Choudhary, J. Ramanuja...
CAL
2010
14 years 12 months ago
A Dynamic Pressure-Aware Associative Placement Strategy for Large Scale Chip Multiprocessors
This paper describes dynamic pressure-aware associative placement (DPAP), a novel distributed cache management scheme for large-scale chip multiprocessors. Our work is motivated by...
Mohammad Hammoud, Sangyeun Cho, Rami G. Melhem
CORR
2004
Springer
128views Education» more  CORR 2004»
15 years 2 months ago
Specialization of Functional Logic Programs Based on Needed Narrowing
Many functional logic languages are based on narrowing, a unification-based goal-solving mechanism which subsumes the reduction mechanism of functional languages and the resolutio...
María Alpuente, Michael Hanus, Salvador Luc...
PLILP
1993
Springer
15 years 6 months ago
Narrowing Approximations as an Optimization for Equational Logic Programs
Abstract. Solving equations in equational theories is a relevant programming paradigm which integrates logic and equational programming into one unified framework. Efficient metho...
María Alpuente, Moreno Falaschi, Marí...
JMLR
2006
92views more  JMLR 2006»
15 years 2 months ago
Linear Programs for Hypotheses Selection in Probabilistic Inference Models
We consider an optimization problem in probabilistic inference: Given n hypotheses Hj, m possible observations Ok, their conditional probabilities pk j, and a particular Ok, selec...
Anders Bergkvist, Peter Damaschke, Marcel Lüt...