7311 search results - page 172 / 1463 » Time in State Machines |
120
click to vote
SCHEDULING
2010
15 years 3 months ago
2010
Scheduling term-end exams (TEE) at the United States Military Academy in West Point is unlike any other exam timetabling problem we know of. Exam timetabling normally produces a c...
137
Voted
WIA
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. Hopcroft’s algorithm for minimizing a deterministic automaton has complexity O(n log n). We show that this complexity bound is tight. More precisely, we provide a famil...
151
click to vote
EPEW
2008
Springer
15 years 6 months ago
2008
Springer
We define a mechanism for specifying performance queries which combine instantaneous observations of model states and finite sequences of observations of model activities. We reali...
144
click to vote
CAINE
2001
15 years 6 months ago
2001
In this paper, a new method for the approximation of discrete time state-affine systems is proposed. The method is based on the diagonalization of proposed generalized controllabi...
139
click to vote
TSP
2010
14 years 11 months ago
2010
This paper addresses cooperative Time Division Duplex (TDD) relaying in the multiple-antenna case with full Channel State Information (CSI), i.e. assuming perfect knowledge of all ...