1686 search results - page 101 / 338 » Programs as polygraphs: computability and complexity |
100
Voted
IEEEPACT
1997
IEEE
15 years 2 months ago
1997
IEEE
† In this paper, we propose a parallel randomized algorithm, called Parallel Fast Assignment using Search Technique (PFAST), for scheduling parallel programs represented by direc...
VLDB
1987
ACM
15 years 1 months ago
1987
ACM
Severalmethodshavebeenproposedto compile recursive Datalog programs. The most well-known perform a rewriting of rules using MAGIC or PROBLEM predicates in order to push selections...
AMW
2010
14 years 11 months ago
2010
A Data Warehouse (DW) is a data repository that integrates data from multiple sources and organizes the data according to a set of data structures called dimensions. Each dimension...
FUIN
2010
14 years 7 months ago
2010
In previous work we have proposed an extension to ASP (Answer Set Programming), called RASP, standing for ASP with Resources. RASP supports declarative reasoning on production and...
113
click to vote
FOSSACS
2011
Springer
14 years 1 months ago
2011
Springer
The model checking of higher-order recursion schemes has been actively studied and is now becoming a basis of higher-order program verification. We propose a new algorithm for tri...