3693 search results - page 383 / 739 » Splitting a Logic Program |
118
click to vote
ISCA
2007
IEEE
15 years 10 months ago
2007
IEEE
The ever increasing sizes of on-chip caches and the growing domination of wire delay necessitate significant changes to cache hierarchy design methodologies. Many recent proposal...
112
click to vote
FSTTCS
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We explain a double-category (of positions and plays) attached to the theory of HOgames (those with the so-called switching condition [7]) from which the category of aren...
148
click to vote
CADE
2004
Springer
15 years 9 months ago
2004
Springer
The dependency pair approach is one of the most powerful techniques for automated (innermost) termination proofs of term rewrite systems (TRSs). For any TRS, it generates inequalit...
139
click to vote
ATAL
2000
Springer
15 years 8 months ago
2000
Springer
In this paper we propose a methodology to help analyse tendencies in MAS to complement those of simple inspection, Monte Carlo and syntactic proof. We suggest an architecture that ...
135
click to vote
MICRO
1998
IEEE
15 years 8 months ago
1998
IEEE
Clustering is one solution to the demand for wideissue machines and fast clock cycles because it allows for smaller, less ported register files and simpler bypass logic while rema...