Sciweavers

242 search results - page 4 / 49
» Finding effective compilation sequences
Sort
View
75
Voted
IJCAI
2007
15 years 1 months ago
Domain Independent Approaches for Finding Diverse Plans
In many planning situations, a planner is required to return a diverse set of plans satisfying the same goals which will be used by the external systems collectively. We take a do...
Biplav Srivastava, Tuan A. Nguyen, Alfonso Gerevin...
KR
2004
Springer
15 years 5 months ago
From Hybrid Systems to Universal Plans Via Domain Compilation
While universal plans tell a system how to reach a goal regardless of what state it is in, such plans can be too large to represent. Hybrid systems execute plans where each action...
Anthony Barrett
LCTRTS
1999
Springer
15 years 4 months ago
Effective Exploitation of a Zero Overhead Loop Buffer
A Zero Overhead Loop Buffer (ZOLB) is an architectural feature that is commonly found in DSP processors. This buffer can be viewed as a compiler managed cache that contains a sequ...
Gang-Ryung Uh, Yuhong Wang, David B. Whalley, Sanj...
ICPP
1999
IEEE
15 years 4 months ago
Compiler Optimizations for I/O-Intensive Computations
This paper describes transformation techniques for out-of-core programs (i.e., those that deal with very large quantities of data) based on exploiting locality using a combination...
Mahmut T. Kandemir, Alok N. Choudhary, J. Ramanuja...
ALMOB
2006
138views more  ALMOB 2006»
14 years 11 months ago
A combinatorial optimization approach for diverse motif finding applications
Background: Discovering approximately repeated patterns, or motifs, in biological sequences is an important and widely-studied problem in computational molecular biology. Most fre...
Elena Zaslavsky, Mona Singh