2313 search results - page 150 / 463 » On Heuristic Time Hierarchies |
143
click to vote
SCHEDULING
2008
15 years 6 months ago
2008
We propose a new approach for scheduling with strict deadlines and apply this approach to the TimeConstrained Project Scheduling Problem (TCPSP). To be able to meet these deadlines...
179
click to vote
TCOM
2010
15 years 4 months ago
2010
Abstract—We investigate routing in cooperative multipleterminal wireless networks in which the nodes can collaborate with each other in data transmission. First, we motivate coop...
206
click to vote
TIME
2003
IEEE
15 years 11 months ago
2003
IEEE
We investigate expressivity and complexity of hybrid logics on linear structures. Hybrid logics are an enrichment of modal logics with certain first-order features which are algo...
156
click to vote
FPL
2006
Springer
15 years 10 months ago
2006
Springer
This paper presents an automated partitioning strategy to divide a design into a set of partitions based on design hierarchy information. While the primary objective is to use the...
147
click to vote
AAAI
1996
15 years 7 months ago
1996
One of the most widespread approaches to reactive planning is Schoppers' universal plans. We propose a stricter definition of universal plans which guarantees a weak notion o...