Sciweavers

2976 search results - page 175 / 596
» On the bounded integer programming
Sort
View
ISSRE
2003
IEEE
15 years 11 months ago
Using a Log-normal Failure Rate Distribution for Worst Case Bound Reliability Prediction
Prior research has suggested that the failure rates of faults follow a log normal distribution. We propose a specific model where distributions close to a log normal arise natural...
Peter G. Bishop, Robin E. Bloomfield
DM
2010
115views more  DM 2010»
15 years 6 months ago
Edge colouring by total labellings
We introduce the concept of an edge-colouring total k-labelling. This is a labelling of the vertices and the edges of a graph G with labels 1, 2, . . . , k such that the weights o...
Stephan Brandt, Kristína Budajová, D...
JSC
2006
102views more  JSC 2006»
15 years 6 months ago
Counterexamples to witness conjectures
Consider the class of exp-log constants, which is constructed from the integers using the field operations, exponentiation and logarithm. Let z be such an exp-log constant and let...
Joris van der Hoeven
153
Voted
IPL
2002
60views more  IPL 2002»
15 years 6 months ago
s-partitions
This note reports on the number of s-partitions of a natural number n. In an s-partition of n each cell has the form 2k - 1 for some integer k. Such partitions have potential appl...
William M. Y. Goh, Pawel Hitczenko, Ali Shokoufand...
COCOA
2010
Springer
15 years 4 months ago
Coverage with k-Transmitters in the Presence of Obstacles
Abstract. For a fixed integer k 0, a k-transmitter is an omnidirectional wireless transmitter with an infinite broadcast range that is able to penetrate up to k "walls",...
Brad Ballinger, Nadia Benbernou, Prosenjit Bose, M...