516 search results - page 62 / 104 » Generalizing the Discrete Timed Automaton |
ICNSC
2008
IEEE
14 years 4 months ago
2008
IEEE
— A facility location problem deals with locating the best place for a group of facilities, among distinct demand points, minimizing a certain locational optimization function. I...
QEST
2006
IEEE
14 years 4 months ago
2006
IEEE
We consider discrete infinite-state Markov chains which contain an eager finite attractor. A finite attractor is a finite subset of states that is eventually reached with prob...
COMPGEOM
2004
ACM
14 years 3 months ago
2004
ACM
We consider the problem of constructing binary space partitions (BSPs) for orthogonal subdivisions (space filling packings of boxes) in d-space. We show that a subdivision with n...
ICPR
2002
IEEE
14 years 11 months ago
2002
IEEE
Tracking is frequently considered a frame-to-frame operation. As such, object recognition techniques are generally too slow to be used for tracking. There are domains, however, wh...
SODA
2010
ACM
14 years 7 months ago
2010
ACM
The quadratic assignment problem (QAP) is a central problem in combinatorial optimization. Several famous computationally hard tasks, such as graph matching, partitioning, and the...