Sciweavers

9176 search results - page 260 / 1836
» algorithms 2010
Sort
View
LION
2010
Springer
190views Optimization» more  LION 2010»
15 years 10 months ago
Algorithm Selection as a Bandit Problem with Unbounded Losses
Abstract. Algorithm selection is typically based on models of algorithm performance learned during a separate offline training sequence, which can be prohibitively expensive. In r...
Matteo Gagliolo, Jürgen Schmidhuber
IPPS
2010
IEEE
15 years 4 months ago
Oblivious algorithms for multicores and network of processors
We address the design of algorithms for multicores that are oblivious to machine parameters. We propose HM, a multicore model consisting of a parallel shared-memory machine with hi...
Rezaul Alam Chowdhury, Francesco Silvestri, Brando...
CORR
2010
Springer
152views Education» more  CORR 2010»
15 years 6 months ago
A Faster Algorithm for Quasi-convex Integer Polynomial Optimization
We present a faster exponential-time algorithm for integer optimization over quasi-convex polynomials. We study the minimization of a quasiconvex polynomial subject to s quasi-con...
Robert Hildebrand, Matthias Köppe
FPGA
2010
ACM
191views FPGA» more  FPGA 2010»
16 years 29 days ago
Voter insertion algorithms for FPGA designs using triple modular redundancy
Triple Modular Redundancy (TMR) is a common reliability technique for mitigating single event upsets (SEUs) in FPGA designs operating in radiation environments. For FPGA systems t...
Jonathan M. Johnson, Michael J. Wirthlin
FAW
2010
Springer
259views Algorithms» more  FAW 2010»
15 years 7 months ago
Adaptive Algorithms for Planar Convex Hull Problems
We study problems in computational geometry from the viewpoint of adaptive algorithms. Adaptive algorithms have been extensively studied for the sorting problem, and in this paper ...
Hee-Kap Ahn, Yoshio Okamoto