Sciweavers

8094 search results - page 92 / 1619
» Improvements in Formula Generalization
Sort
View
DAM
2008
85views more  DAM 2008»
13 years 9 months ago
The competition numbers of complete tripartite graphs
For a graph G, it is known to be a hard problem to compute the competition number k(G) of the graph G in general. In this paper, we give an explicit formula for the competition nu...
Suh-Ryung Kim, Yoshio Sano
EOR
2006
81views more  EOR 2006»
13 years 9 months ago
A note on duality gap in the simple plant location problem
This paper studies the duality gap in the simple plant location problem, and presents general formulas for the gap when certain complementary slackness conditions are satisfied. W...
Nenad Mladenovic, Jack Brimberg, Pierre Hansen
COMBINATORICS
2007
68views more  COMBINATORICS 2007»
13 years 9 months ago
Compositions of Graphs Revisited
The idea of graph compositions, which was introduced by A. Knopfmacher and M. E. Mays, generalizes both ordinary compositions of positive integers and partitions of finite sets. ...
Aminul Huq
JSYML
2006
84views more  JSYML 2006»
13 years 9 months ago
Bounded modified realizability
We define a notion of realizability, based on a new assignment of formulas, which does not care for precise witnesses of existential statements, but only for bounds for them. The ...
Fernando Ferreira, Ana Nunes
TC
2008
13 years 9 months ago
A More Realistic Thinning Scheme for Call Admission Control in Multimedia Wireless Networks
A call admission control scheme named thinning scheme, which smoothly throttles the admission rates of calls according to their priorities and aims to provide multiple prioritized ...
Xian Wang, Pingzhi Fan, Yi Pan