934 search results - page 55 / 187 » exact 2007 |
131
click to vote
WG
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We present hardness results, approximation heuristics, and exact algorithms for bottleneck labeled optimization problems arising in the context of graph theory. This long...
174
click to vote
ACSD
2007
IEEE
15 years 8 months ago
2007
IEEE
In this paper we present two algorithms that effectively synthesize a finite place/transition Petri net (p/t-net) from a finite set of labeled partial orders (a finite partial lang...
140
click to vote
IBPRIA
2007
Springer
15 years 8 months ago
2007
Springer
Three methods for the efficient downdating, composition and splitting of low rank singular value decompositions are proposed. They are formulated in a closed form, considering the ...
109
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
This paper describes a system capable of semi-automatically filling an XML template from free texts in the clinical domain (practice guidelines). The XML template includes semanti...
152
click to vote
FUIN
2007
15 years 4 months ago
2007
The paper presents a method of abstraction for timed systems. To extract an abstract model of a timed system we propose to use static analysis, namely a technique called path compr...