580 search results - page 19 / 116 » Approximation Algorithms for Temporal Reasoning |
111
click to vote
KR
2000
Springer
15 years 3 months ago
2000
Springer
When reasoning in description, modal or temporal logics it is often useful to consider axioms representing universal truths in the domain of discourse. Reasoning with respect to a...
107
click to vote
ATAL
2003
Springer
15 years 5 months ago
2003
Springer
Agents collaborating on a set of tasks subject to temporal constraints must coordinate their activities to ensure that all of the temporal constraints are ultimately satisfied. S...
122
click to vote
SODA
2010
ACM
15 years 9 months ago
2010
ACM
The minimum latency problem (MLP) is a well-studied variant of the traveling salesman problem (TSP). In the MLP, the server's goal is to minimize the average latency that the...
ICASSP
2011
IEEE
14 years 3 months ago
2011
IEEE
This paper proposes a compressive sampling scheme based on random temporal sampling using a successive approximation register (SAR) ADC architecture. Variable wordlength data samp...
FROCOS
2007
Springer
15 years 5 months ago
2007
Springer
Often when formalising dynamic systems, constraints such as exactly “n” of a set of values hold. In this paper, we consider reasoning about propositional linear time temporal ...