12289 search results - page 159 / 2458 » computing 2006 |
114
click to vote
JPDC
2006
15 years 3 months ago
2006
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
113
Voted
MP
2006
15 years 3 months ago
2006
Abstract We give new error bounds for the linear complementarity problem where the involved matrix is a P-matrix. Computation of rigorous error bounds can be turned into a P-matrix...
132
click to vote
MP
2006
15 years 3 months ago
2006
Stochastic programming is the subfield of mathematical programming that considers optimization in the presence of uncertainty. During the last four decades a vast amount of litera...
109
click to vote
IGPL
2007
15 years 3 months ago
2007
This work studies the structure of proofs containing non-analytic cuts in the cut-based system, a sequent inference system in which the cut rule is not eliminable and the only bra...
127
click to vote
PUC
2006
15 years 3 months ago
2006
Abstract. The Stanford Event Heap has been shown to provide appropriate support for constructing interactive workspace applications. Given this success it is natural to consider th...