Sciweavers

980 search results - page 2 / 196
» A Sequential Reduction Strategy
Sort
View
ICLP
1997
Springer
13 years 9 months ago
Parallel Evaluation Strategies for Functional Logic Languages
We introduce novel, sound, complete, and locally optimal evaluation strategies for functional logic programming languages. Our strategies combine, in a non-trivial way, two landma...
Sergio Antoy, Rachid Echahed, Michael Hanus
IPPS
2003
IEEE
13 years 10 months ago
Miss Penalty Reduction Using Bundled Capacity Prefetching in Multiprocessors
While prefetch has proven itself useful for reducing cache misses in multiprocessors, traffic is often increased due to extra unused prefetch data. Prefetching in multiprocessors...
Dan Wallin, Erik Hagersten
GLVLSI
2009
IEEE
122views VLSI» more  GLVLSI 2009»
14 years 15 hour ago
Enhancing SAT-based sequential depth computation by pruning search space
The sequential depth determines the completeness of bounded model checking in design verification. Recently, a SATbased method is proposed to compute the sequential depth of a de...
Yung-Chih Chen, Chun-Yao Wang
DAWAK
2006
Springer
13 years 7 months ago
COBRA: Closed Sequential Pattern Mining Using Bi-phase Reduction Approach
Sequential pattern mining aims to find frequent patterns (guarded by a minimum support) in a database of sequences. As the support decreases the number of sequential patterns will...
Kuo-Yu Huang, Chia-Hui Chang, Jiun-Hung Tung, Chen...
CORR
2010
Springer
76views Education» more  CORR 2010»
13 years 5 months ago
Infinitary Combinatory Reduction Systems: Normalising Reduction Strategies
Abstract. We study normalising reduction strategies for infinitary Combinatory Reduction Systems (iCRSs). We prove that all fair, outermost-fair, and needed-fair strategies are nor...
Jeroen Ketema, Jakob Grue Simonsen