3229 search results - page 556 / 646 » The Theory of Timed Automata |
166
click to vote
KI
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. In this paper, a framework for previous and new quasi-exact extensions of the A -algorithm is presented. In contrast to previous approaches, the new methods guarantee to ...
151
click to vote
SIGMETRICS
2008
ACM
15 years 5 months ago
2008
ACM
Burstiness and temporal dependence in service processes are often found in multi-tier architectures and storage devices and must be captured accurately in capacity planning models...
161
click to vote
JCT
2007
15 years 5 months ago
2007
An edge in a drawing of a graph is called even if it intersects every other edge of the graph an even number of times. Pach and T´oth proved that a graph can always be redrawn so...
167
click to vote
JETAI
2007
15 years 5 months ago
2007
Reasoning, problem solving, indeed the general process of acquiring knowledge, is not an isolated, homogenous affair involving a one agent using a single form of representation, b...
170
click to vote
TELSYS
2002
15 years 5 months ago
2002
Abstract. In the micro-cell-based PCS networks, due to the high user mobility, handoffs occur more frequently. Hence, the classical assumptions, such as the exponential assumptions...