2313 search results - page 70 / 463 » On Heuristic Time Hierarchies |
140
click to vote
ORL
2008
15 years 4 months ago
2008
We consider the problem of on-line scheduling with non-crossing constraints. The objective is to minimize the latest completion time. We provide optimal competitive ratio heuristi...
149
click to vote
ACMSE
2006
ACM
16 years 7 days ago
2006
ACM
Although the satisfiability problem (SAT) is NP-complete, state-of-the-art solvers for SAT can solve instances that are considered to be very hard. Emerging applications demand t...
161
click to vote
QUESTA
2007
15 years 5 months ago
2007
We present the queueing analysis of a degenerate buffer having access to a single server. This system cannot realize any given delay, but only values that are an integer multiple ...
164
click to vote
ECRTS
2003
IEEE
15 years 11 months ago
2003
IEEE
This paper deals with specific issues related to the design of distributed embedded systems implemented with mixed, event-triggered and time-triggered task sets, which communicate...
155
click to vote
CIG
2005
IEEE
15 years 12 months ago
2005
IEEE
Real-Time Strategy games present an interesting problem domain for Artificial Intelligence research. We review current approaches to developing AI systems for such games, noting th...