352 search results - page 46 / 71 » On the optimal reachability problem of weighted timed automa... |
ACSD
2006
IEEE
15 years 6 months ago
2006
IEEE
We study the monitoring and fault-diagnosis problems for dense-time real-time systems, where observers (monitors and diagnosers) have access to digital rather than analog clocks. ...
105
click to vote
ACRI
2004
Springer
15 years 5 months ago
2004
Springer
We have investigated a problem where the goal is to find automatically the best rule for a cell in the cellular automata model. The cells are either of type OBSTACLE, EMPTY or CRE...
150
Voted
SIROCCO
1997
15 years 1 months ago
1997
A cellular network is generally modeled as a subgraph of the triangular lattice. In the static frequency assignment problem, each vertex of the graph is a base station in the netw...
139
click to vote
CORR
2007
Springer
15 years 13 days ago
2007
Springer
Abstract— In this paper, collocated and distributed spacetime block codes (DSTBCs) which admit multi-group maximum likelihood (ML) decoding are studied. First the collocated case...
127
click to vote
NN
2000
Springer
15 years 7 days ago
2000
Springer
Piecewise-linear (PWL) neural networks are widely known for their amenability to digital implementation. This paper presents a new algorithm for learning in PWL networks consistin...