4674 search results - page 189 / 935 » cases 2008 |
137
click to vote
IPL
2008
15 years 6 months ago
2008
Fast Paxos is an algorithm for consensus that works by a succession of rounds, where each round tries to decide a value v that is consistent with all past rounds. Rounds are start...
167
click to vote
JGO
2008
15 years 6 months ago
2008
This article complements the paper [7], where we showed that a compact feasible set of a standard semi-infinite optimization problem can be approximated arbitrarily well by a leve...
149
click to vote
JGT
2008
15 years 6 months ago
2008
: A (g, f )-factor of a graph is a subset F of E such that for all v V, g(v) degF(v) f(v). Lovasz gave a necessary and sufficient condition for the existence of a (g, f )-factor...
150
click to vote
JGT
2008
15 years 6 months ago
2008
Let C be a family of n compact connected sets in the plane, whose intersection graph G(C) has no complete bipartite subgraph with k vertices in each of its classes. Then G(C) has ...
153
click to vote
CSDA
2007
15 years 6 months ago
2007
An efficient estimate for the change point in the hazard function is obtained. This is based on a Bayesian estimator which uses equations concerning the parameters of a recently ...