Sciweavers

1071 search results - page 14 / 215
» Programming with enumerable sets of structures
Sort
View
MICRO
1994
IEEE
99views Hardware» more  MICRO 1994»
14 years 1 months ago
Data relocation and prefetching for programs with large data sets
Numerical applications frequently contain nested loop structures that process large arrays of data. The execution of these loop structures often produces memory preference pattern...
Yoji Yamada, John Gyllenhall, Grant Haab, Wen-mei ...
IPCO
2001
117views Optimization» more  IPCO 2001»
13 years 11 months ago
Pruning by Isomorphism in Branch-and-Cut
The paper presents a branch-and-cut for solving (0, 1) integer linear programs having a large symmetry group. The group is used for pruning the enumeration tree and for generating ...
François Margot
AGP
2003
IEEE
14 years 3 months ago
Transforming co-NP Checks to Answer Set Computation by Meta-Interpretation
Many NP-complete problems can be encoded in the answer set semantics of logic programs in a very concise way, where the encoding reflects the typical “guess and check” nature ...
Thomas Eiter, Axel Polleres
BMCBI
2004
127views more  BMCBI 2004»
13 years 9 months ago
MolTalk - a programming library for protein structures and structure analysis
Background: Two of the mostly unsolved but increasingly urgent problems for modern biologists are a) to quickly and easily analyse protein structures and b) to comprehensively min...
Alexander V. Diemand, Holger Scheib
CORR
2008
Springer
110views Education» more  CORR 2008»
13 years 10 months ago
Justifications for Logic Programs under Answer Set Semantics
The paper introduces the notion of off-line justification for Answer Set Programming (ASP). Justifications provide a graph-based explanation of the truth value of an atom w.r.t. a ...
Enrico Pontelli, Tran Cao Son, Omar El-Khatib