Sciweavers

65 search results - page 8 / 13
» Program termination and well partial orderings
Sort
View
AAAI
2004
13 years 10 months ago
Branching and Pruning: An Optimal Temporal POCL Planner Based on Constraint Programming
A key feature of modern optimal planners such as Graphplan and Blackbox is their ability to prune large parts of the search space. Previous Partial Order Causal Link (POCL) planne...
Vincent Vidal, Hector Geffner
CORR
2006
Springer
91views Education» more  CORR 2006»
13 years 8 months ago
Quasi-friendly sup-interpretations
In a previous paper [16], the sup-interpretation method was proposed as a new tool to control memory resources of first order functional programs with pattern matching by static an...
Jean-Yves Marion, Romain Péchoux
SIGMETRICS
2011
ACM
161views Hardware» more  SIGMETRICS 2011»
12 years 11 months ago
Modeling program resource demand using inherent program characteristics
The workloads in modern Chip-multiprocessors (CMP) are becoming increasingly diversified, creating different resource demands on hardware substrate. It is necessary to allocate h...
Jian Chen, Lizy Kurian John, Dimitris Kaseridis
IANDC
2008
141views more  IANDC 2008»
13 years 8 months ago
Graph connectivity, partial words, and a theorem of Fine and Wilf
The problem of computing periods in words, or finite sequences of symbols from a finite alphabet, has important applications in several areas including data compression, string se...
Francine Blanchet-Sadri, Deepak Bal, Gautam Sisodi...
JFP
2000
163views more  JFP 2000»
13 years 8 months ago
Automatic useless-code elimination for HOT functional programs
In this paper we present two type inference systems for detecting useless-code in higher-order typed functional programs. Type inference can be performed in an efficient and compl...
Ferruccio Damiani, Paola Giannini