Sciweavers

406 search results - page 38 / 82
» Boosting Using Branching Programs
Sort
View
95
Voted
EUROPAR
2000
Springer
15 years 4 months ago
Novel Models for Or-Parallel Logic Programs: A Performance Analysis
One of the advantages of logic programming is the fact that it offers many sources of implicit parallelism, such as and-parallelism and or-parallelism. Arguably, or-parallel system...
Vítor Santos Costa, Ricardo Rocha, Fernando...
AAAI
2008
15 years 2 months ago
Efficient Haplotype Inference with Answer Set Programming
Identifying maternal and paternal inheritance is essential to be able to find the set of genes responsible for a particular disease. Although we have access to genotype data (gene...
Esra Erdem, Ferhan Türe
LCTRTS
2009
Springer
15 years 7 months ago
Guaranteeing instruction fetch behavior with a lookahead instruction fetch engine (LIFE)
Instruction fetch behavior has been shown to be very regular and predictable, even for diverse application areas. In this work, we propose the Lookahead Instruction Fetch Engine (...
Stephen Roderick Hines, Yuval Peress, Peter Gavin,...
98
Voted
SASP
2009
IEEE
156views Hardware» more  SASP 2009»
15 years 7 months ago
Introducing control-flow inclusion to support pipelining in custom instruction set extensions
—Multi-cycle Instruction set extensions (ISE) can be pipelined in order to increase their throughput; however, typical program traces seldom contain consecutive calls to the same...
Marcela Zuluaga, Theo Kluter, Philip Brisk, Nigel ...
103
Voted
ISSS
2002
IEEE
124views Hardware» more  ISSS 2002»
15 years 5 months ago
Timing Analysis of Embedded Software for Speculative Processors
Static timing analysis of embedded software is important for systems with hard real-time constraints. To accurately estimate time bounds, it is essential to model the underlying m...
Abhik Roychoudhury, Xianfeng Li, Tulika Mitra