793 search results - page 83 / 159 » Argumentation and standards of proof |
89
Voted
SIAMDM
2008
15 years 17 days ago
2008
Robertson and Seymour (1990) proved that graphs of bounded tree-width are well-quasi-ordered by the graph minor relation. By extending their arguments, Geelen, Gerards, and Whittle...
105
Voted
SIAMDM
2008
15 years 17 days ago
2008
A set of pairwise edge-disjoint triangles of an edge-colored Kn is r-color avoiding if it does not contain r monochromatic triangles, each having a different color. Let fr(n) be th...
QUESTA
2010
14 years 11 months ago
2010
The M/G/K queueing system is one of the oldest model for multi-server systems, and has been the topic of performance papers for almost half a century. However, even now, only coar...
108
click to vote
CORR
2011
Springer
14 years 7 months ago
2011
Springer
We consider a consensus algorithm in which every node in a time-varying undirected connected graph assigns equal weight to each of its neighbors. Under the assumption that the deg...
129
Voted
ALGORITHMICA
2011
14 years 4 months ago
2011
Speed scaling is a power management technique that involves dynamically changing the speed of a processor. This gives rise to dual-objective scheduling problems, where the operati...