3229 search results - page 448 / 646 » The Theory of Timed Automata |
158
click to vote
SMA
2003
ACM
15 years 12 months ago
2003
ACM
The prediction of collisions amongst N rigid objects may be reduced to a series of computations of the time to first contact for all pairs of objects. Simple enclosing bounds and...
183
click to vote
COCO
2004
Springer
15 years 10 months ago
2004
Springer
Based on the framework of parameterized complexity theory, we derive tight lower bounds on the computational complexity for a number of well-known NP-hard problems. We start by pr...
174
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
In this work an improvement of an initial approach to design Artificial Neural Networks to forecast Time Series is tackled, and the automatic process to design Artificial Neural N...
205
Voted
EOR
2007
15 years 6 months ago
2007
Heavy industry maintenance facilities at aircraft service centers or railroad yards must contend with scheduling preventive maintenance tasks to ensure critical equipment remains ...
161
click to vote
SIGMETRICS
2008
ACM
15 years 6 months ago
2008
ACM
Although recent advances in theory indicate that burstiness in the service time process can be handled effectively by queueing models (e.g., MAP queueing networks [2]), there is a...