1722 search results - page 298 / 345 » On the sample mean of graphs |
180
click to vote
ACSAC
2001
IEEE
15 years 10 months ago
2001
IEEE
Software component technology facilitates the costeffective development of specialized applications. Nevertheless, due to the high number of principals involved in a component-str...
168
Voted
COLT
1995
Springer
15 years 10 months ago
1995
Springer
We present algorithms for exactly learning unknown environments that can be described by deterministic nite automata. The learner performs a walk on the target automaton, where at...
188
click to vote
UML
2000
Springer
15 years 10 months ago
2000
Springer
In this paper, dynamic meta modeling is proposed as a new approach to the operational semantics of behavioral UML diagrams. The dynamic meta model extends the well-known static met...
202
click to vote
UML
2000
Springer
15 years 10 months ago
2000
Springer
Software testing can only be formalized and quanti ed when a solid basis for test generation can be de ned. Tests are commonly generated from program source code, graphical models ...
164
click to vote
LICS
1997
IEEE
15 years 10 months ago
1997
IEEE
We consider a class of infinite two-player games on finitely coloured graphs. Our main question is: given a winning condition, what is the inherent blow-up (additional memory) of ...