2354 search results - page 230 / 471 » Radio number for trees |
162
click to vote
CONCUR
2000
Springer
15 years 11 months ago
2000
Springer
Abstract. In this paper, we introduce weak bisimulation in the framework of Labeled Concurrent Markov Chains, that is, probabilistic transition systems which exhibit both probabili...
210
click to vote
DEXAW
2007
IEEE
15 years 10 months ago
2007
IEEE
The problem of efficiently evaluating XPath and XQuery queries has become increasingly significant since more and more XML data is stored in its native form. We propose a novel op...
192
click to vote
IJCAI
2003
15 years 8 months ago
2003
Given a set of numbers, and a set of bins of fixed capacity, the NP-complete problem of bin packing is to find the minimum number of bins needed to contain the numbers, such that ...
186
click to vote
IJCAI
1997
15 years 8 months ago
1997
Discretization refers to splitting the range of continuous values into intervals so as to provide useful information about classes. This is usually done by minimizing a goodness m...
186
click to vote
WALCOM
2010
IEEE
15 years 5 months ago
2010
IEEE
Treewidth and pathwidth are important graph parameters that represent how close the graph is to trees and paths respectively. We calculate treewidth and pathwidth on parameterized ...