2430 search results - page 252 / 486 » Computing Tutte Polynomials |
139
click to vote
WINE
2010
Springer
15 years 1 months ago
2010
Springer
We design algorithms for computing approximately revenue-maximizing sequential postedpricing mechanisms (SPM) in K-unit auctions, in a standard Bayesian model. A seller has K copi...
124
click to vote
MOC
2010
14 years 11 months ago
2010
Abstract. We introduce a new mixed method for linear elasticity. The novelty is a simplicial element for the approximate stress. For every positive integer k, the row-wise divergen...
179
Voted
SIAMNUM
2010
14 years 11 months ago
2010
A straightforward discretisation of problems in d spatial dimensions often leads to an exponential growth in the number of degrees of freedom. Thus, even efficient algorithms like ...
153
click to vote
CORR
2011
Springer
14 years 7 months ago
2011
Springer
The AdaBoost algorithm was designed to combine many “weak” hypotheses that perform slightly better than random guessing into a “strong” hypothesis that has very low error....
265
click to vote
RTAS
2011
IEEE
14 years 7 months ago
2011
IEEE
— This paper presents the Fixed Priority until Zero Laxity (FPZL) scheduling algorithm for multiprocessor realtime systems. FPZL is similar to global fixed priority preemptive sc...