3750 search results - page 563 / 750 » Timed Automata Patterns |
137
click to vote
RTSS
2000
IEEE
15 years 6 months ago
2000
IEEE
Many industrial applications with real-time demands are composed of mixed sets of tasks with a variety of requirements. These can be in the form of standard timing constraints, su...
149
Voted
CIKM
2008
Springer
15 years 5 months ago
2008
Springer
Given a collection of complex, time-stamped events, how do we find patterns and anomalies? Events could be meetings with one or more persons with one or more agenda items at zero ...
129
click to vote
AIPS
2003
15 years 4 months ago
2003
We present an efficient algorithm for exact calculation and minimization of expected waiting times of all passengers using a bank of elevators. The dynamics of the system are rep...
147
click to vote
SDM
2003
SIAM
15 years 4 months ago
2003
SIAM
The problem of finding clusters in data is challenging when clusters are of widely differing sizes, densities and shapes, and when the data contains large amounts of noise and out...
146
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic programming s...