9842 search results - page 403 / 1969 » The Complexity of the Matching-Cut Problem |
109
click to vote
INFORMATICALT
2000
15 years 4 months ago
2000
The accuracy of adaptive integration algorithms for solving stiff ODE is investigated. The analysis is done by comparing the discrete and exact amplification factors of the equatio...
122
click to vote
IVC
2000
15 years 4 months ago
2000
Rule-based systems employed to model complex object behaviours, do not necessarily provide a realistic portrayal of true behaviour. To capture the real characteristics in a specif...
134
Voted
CCE
2008
15 years 4 months ago
2008
Scheduling of processes in mixed batch/continuous plants, due to their hybrid nature can become very complex. This paper presents the Timed Hybrid Petri net (THPN) as a suitable t...
155
Voted
FSTTCS
2010
Springer
15 years 2 months ago
2010
Springer
Bisimulation equivalence is decidable in polynomial time over normed graphs generated by a context-free grammar. We present a new algorithm, working in time O(n5 ), thus improving...
142
click to vote
IGARSS
2010
15 years 2 months ago
2010
Interactive visualization systems allow extensive adjustments of the visualization process, to give the user full control over the visualization result. However, this flexibility ...