1716 search results - page 267 / 344 » Proving Conditional Termination |
GD
2004
Springer
15 years 6 months ago
2004
Springer
Consider the following question: does every complete geometric graph K2n have a partition of its edge set into n plane spanning trees? We approach this problem from three directio...
GG
2004
Springer
15 years 6 months ago
2004
Springer
The concept of typed attributed graph transformation is most significant for modeling and meta modeling in software engineering and visual languages, but up to now there is no ade...
126
click to vote
HYBRID
2004
Springer
15 years 6 months ago
2004
Springer
We present a parameter inference algorithm for autonomous stochastic linear hybrid systems, which computes a maximum-likelihood model, given only a set of continuous output data of...
104
click to vote
ISPA
2004
Springer
15 years 6 months ago
2004
Springer
Context-aware computing is a computing paradigm in which applications can take advantage of contextual information. Quality of network connection is a very important factor for mob...
102
click to vote
JCDCG
2004
Springer
15 years 6 months ago
2004
Springer
We prove that all single-vertex origami shapes are reachable from the open flat state via simple, non-crossing motions. We also consider conical paper, where the total sum of the ...