Sciweavers

4137 search results - page 338 / 828
» On the number of matchings of a tree
Sort
View
IPCO
2010
184views Optimization» more  IPCO 2010»
15 years 8 months ago
Computing Minimum Multiway Cuts in Hypergraphs from Hypertree Packings
Hypergraph multiway cut problem is a problem of finding a minimum capacity set of hyperedges whose removal divides a given hypergraph into a specified number of connected componen...
Takuro Fukunaga
CEE
2006
92views more  CEE 2006»
15 years 7 months ago
Optimizing the performance of tree-based reliable multicast
The expected number of transmissions is a very important parameter to evaluate the multicast performance. It is often used to estimate the bandwidth consumption of tree-based reli...
Zuo Wen Wan, Michel Kadoch, Ahmed K. Elhakeem
COMBINATORICS
2000
128views more  COMBINATORICS 2000»
15 years 6 months ago
Continued Fractions and Catalan Problems
We find a generating function expressed as a continued fraction that enumerates ordered trees by the number of vertices at different levels. Several Catalan problems are mapped to...
Mahendra Jani, Robert G. Rieper
163
Voted
IPPS
2003
IEEE
16 years 4 days ago
Master-slave Tasking on Heterogeneous Processors
In this paper, we consider the problem of scheduling independent identical tasks on heterogeneous processors where communication times and processing times are different. We assum...
Pierre-François Dutot
168
Voted
CONCUR
2000
Springer
15 years 11 months ago
Weak Bisimulation for Probabilistic Systems
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...
Anna Philippou, Insup Lee, Oleg Sokolsky