4894 search results - page 81 / 979 » The Guarding Problem - Complexity and Approximation |
FMSD
2008
13 years 9 months ago
2008
Timed automata are governed by an idealized semantics that assumes a perfectly precise behavior of the clocks. The traditional semantics is not robust because the slightest perturb...
CORR
2009
Springer
13 years 6 months ago
2009
Springer
Transactional events (TE) are an extension of Concurrent ML (CML), a programming model for synchronous message-passing. Prior work has focused on TE's formal semantics and it...
SIAMCO
2008
13 years 9 months ago
2008
It has been established recently that, under mild conditions, deterministic long run average problems of optimal control are "asymptotically equivalent" to infinite-dimen...
APPROX
2010
Springer
13 years 10 months ago
2010
Springer
In this paper, we consider the checkpoint problem in which given an undirected graph G, a set of sourcedestinations {(s1, t1), (s1, t1), . . . , (sk, tk)} and a set of fixed paths...
CP
2003
Springer
14 years 2 months ago
2003
Springer
Knapsack constraints are a key modeling structure in discrete optimization and form the core of many real-life problem formulations. Only recently, a cost-based filtering algorit...