708 search results - page 60 / 142 » Timing closure: the solution and its problems |
162
click to vote
JSA
2000
15 years 6 months ago
2000
Scheduling DAGs with communication times is the theoretical basis for achieving efficient parallelism on distributed memory systems. We generalize Graham's task-level in a ma...
163
click to vote
JELIA
1998
Springer
15 years 10 months ago
1998
Springer
Successor state axioms are an optimal solution to the famous Frame Problem in reasoning about actions--but only as far as its representational aspect is concerned. We show how by g...
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
BIRD
2008
Springer
15 years 8 months ago
2008
Springer
We study the problem of structured motif search in DNA sequences. This is a fundamental task in bioinformatics which contributes to better understanding of genome characteristics a...
153
click to vote
ATAL
2006
Springer
15 years 10 months ago
2006
Springer
This paper studies bilateral, multi-issue negotiation between self-interested agents with deadlines. There are a number of procedures for negotiating the issues and each of these g...