22588 search results - page 4464 / 4518 » On simulation model complexity |
116
click to vote
ICSE
1999
IEEE-ACM
15 years 8 months ago
1999
IEEE-ACM
Software architectures, like complex designs in any field, embody tradeoffs made by the designers. However, these tradeoffs are not always made explicitly by the designers and the...
153
click to vote
LLL
1999
Springer
15 years 8 months ago
1999
Springer
Abstract. Automatic lemmatisation is a core application for many language processing tasks. In inflectionally rich languages, such as Slovene, assigning the correct lemma to each ...
134
click to vote
RTSS
1998
IEEE
15 years 8 months ago
1998
IEEE
Timed and hybrid automata are extensions of finite-state machines for formal modeling of embedded systems with both discrete and continuous components. Reachability problems for t...
126
click to vote
NPIV
1998
ACM
15 years 8 months ago
1998
ACM
We explore techniques from visualization and computational geometry to make tactical information more intuitive to a military commander. To be successful, the commander must quick...
130
click to vote
WG
1998
Springer
15 years 8 months ago
1998
Springer
In this work we introduce the class of graphs with bounded induced distance of order k, (BID(k) for short). A graph G belongs to BID(k) if the distance between any two nodes in ev...