Sciweavers

96 search results - page 13 / 20
» Variable Ordering Heuristics Show Promise
Sort
View
CGO
2011
IEEE
14 years 1 months ago
Language and compiler support for auto-tuning variable-accuracy algorithms
—Approximating ideal program outputs is a common technique for solving computationally difficult problems, for adhering to processing or timing constraints, and for performance ...
Jason Ansel, Yee Lok Wong, Cy P. Chan, Marek Olsze...
SIGMOD
2006
ACM
170views Database» more  SIGMOD 2006»
15 years 10 months ago
COLT: continuous on-line tuning
Self-tuning is a cost-effective and elegant solution to the important problem of configuring a database to the characteristics of the query load. Existing techniques operate in an...
Karl Schnaitter, Serge Abiteboul, Tova Milo, Neokl...
FPGA
2009
ACM
154views FPGA» more  FPGA 2009»
15 years 4 months ago
Synthesis of reconfigurable high-performance multicore systems
Reconfigurable high-performance computing systems (RHPC) have been attracting more and more attention over the past few years. RHPC systems are a promising solution for accelerati...
Jason Cong, Karthik Gururaj, Guoling Han
AIPS
2003
14 years 11 months ago
The Role of Planning in Grid Computing
Grid computing gives users access to widely distributed networks of computing resources to solve large-scale tasks such as scientific computation. These tasks are defined as stand...
Jim Blythe, Ewa Deelman, Yolanda Gil, Carl Kesselm...
IJCAI
2001
14 years 11 months ago
Bundle Design in Robust Combinatorial Auction Protocol against False-name Bids
This paper presents a method for designing bundles in a combinatorial auction protocol that is robust against false-name bids. Internet auctions have become an integral part of El...
Makoto Yokoo, Yuko Sakurai, Shigeo Matsubara