Sciweavers

201 search results - page 23 / 41
» Incremental Algorithms for Approximate Compilation
Sort
View
CASES
2009
ACM
15 years 4 months ago
Optimal loop parallelization for maximizing iteration-level parallelism
This paper solves the open problem of extracting the maximal number of iterations from a loop that can be executed in parallel on chip multiprocessors. Our algorithm solves it opt...
Duo Liu, Zili Shao, Meng Wang, Minyi Guo, Jingling...
AI
2002
Springer
14 years 9 months ago
Algorithm for optimal winner determination in combinatorial auctions
Combinatorial auctions, that is, auctions where bidders can bid on combinations of items, tend to lead to more efficient allocations than traditional auction mechanisms in multi-i...
Tuomas Sandholm
75
Voted
INFOCOM
2005
IEEE
15 years 3 months ago
Measurement-based multipath multicast
Abstract— We propose a measurement-based routing algorithm to load balance intradomain traffic along multiple paths for multiple multicast sources. Multiple paths are establishe...
Tuna Güven, Richard J. La, Mark A. Shayman, B...
ICML
2010
IEEE
14 years 7 months ago
The Margin Perceptron with Unlearning
We introduce into the classical Perceptron algorithm with margin a mechanism of unlearning which in the course of the regular update allows for a reduction of possible contributio...
Constantinos Panagiotakopoulos, Petroula Tsampouka
ICML
2005
IEEE
15 years 10 months ago
Combining model-based and instance-based learning for first order regression
T ORDER REGRESSION (EXTENDED ABSTRACT) Kurt Driessensa Saso Dzeroskib a Department of Computer Science, University of Waikato, Hamilton, New Zealand (kurtd@waikato.ac.nz) b Departm...
Kurt Driessens, Saso Dzeroski