2313 search results - page 25 / 463 » On Heuristic Time Hierarchies |
146
click to vote
STACS
2001
Springer
15 years 10 months ago
2001
Springer
We propose a new, logical, approach to the decidability problem for the Straubing and Brzozowski hierarchies based on the preservation theorems from model theory, on a theorem of ...
194
click to vote
ICPADS
2007
IEEE
16 years 15 days ago
2007
IEEE
Given an undirected graph with weights associated with its edges, the Steiner tree problem consists of finding a minimum weight subtree spanning a given subset of (terminal) nodes...
171
click to vote
FLAIRS
2007
15 years 8 months ago
2007
Currently, among the fastest approaches to AI task planning we find many forward-chaining heuristic planners, as FF. Most of their good performance comes from the use of domain-i...
143
click to vote
EOR
2007
15 years 6 months ago
2007
Academic subjects made judgmental forecasts of a graphically presented time series in a laboratory experiment. Besides the past realizations of the time series itself, the only av...
143
click to vote
APCSAC
2004
IEEE
15 years 10 months ago
2004
IEEE
The RAMpage hierarchy moves main memory up a level to replace the lowest-level cache by an equivalent-sized SRAM main memory. This paper is a first look at the value of RAMpage to ...