5210 search results - page 206 / 1042 » Exact geometric computation |
200
Voted
PE
2011
Springer
15 years 1 months ago
2011
Springer
High-level semi-Markov modelling paradigms such as semi-Markov stochastic Petri nets and process algebras are used to capture realistic performance models of computer and communic...
154
click to vote
DAC
1999
ACM
16 years 7 months ago
1999
ACM
Finding the minimum column multiplicity for a bound set of variables is an important problem in Curtis decomposition. To investigate this problem, we compared two graphcoloring pr...
162
click to vote
AI
1998
Springer
15 years 10 months ago
1998
Springer
Abstract. Dynamic Bayesian networks (DBNs) extend Bayesian networks from static domains to dynamic domains. The only known generic method for exact inference in DBNs is based on dy...
177
click to vote
ESA
2000
Springer
15 years 9 months ago
2000
Springer
The resource constrained shortest path problem (CSP) asks for the computation of a least cost path obeying a set of resource constraints. The problem is NP-complete. We give theore...
221
click to vote
ENDM
2000
15 years 5 months ago
2000
We propose a new exact algorithm for finding the chromatic number of a graph G. The algorithm attempts to determine the smallest possible induced subgraph G' of G which has t...