Sciweavers

12783 search results - page 632 / 2557
» Experimenting with computing
Sort
View
PVLDB
2010
190views more  PVLDB 2010»
15 years 1 months ago
Efficient B-tree Based Indexing for Cloud Data Processing
A Cloud may be seen as a type of flexible computing infrastructure consisting of many compute nodes, where resizable computing capacities can be provided to different customers. T...
Sai Wu, Dawei Jiang, Beng Chin Ooi, Kun-Lung Wu
ACMSE
2011
ACM
14 years 7 months ago
Targeting FPGA-based processors for an implementation-driven compiler construction course
This paper describes the adaptation of a modern compiler construction course to target an FPGA-based hardware platform used throughout our computer science curriculum. One of the ...
D. Brian Larkins, William M. Jones
ATAL
2011
Springer
14 years 7 months ago
Game theory-based opponent modeling in large imperfect-information games
We develop an algorithm for opponent modeling in large extensive-form games of imperfect information. It works by observing the opponent’s action frequencies and building an opp...
Sam Ganzfried, Tuomas Sandholm
COMPUTING
2006
127views more  COMPUTING 2006»
15 years 7 months ago
PHoMpara - Parallel Implementation of the Polyhedral Homotopy Continuation Method for Polynomial Systems
The polyhedral homotopy continuation method is known to be a successful method for finding all isolated solutions of a system of polynomial equations. PHoM, an implementation of t...
T. Gunji, S. Kim, K. Fujisawa, M. Kojima
AAAI
2004
15 years 8 months ago
Eliciting Bid Taker Non-price Preferences in (Combinatorial) Auctions
Recent algorithms provide powerful solutions to the problem of determining cost-minimizing (or revenue-maximizing) allocations of items in combinatorial auctions. However, in many...
Craig Boutilier, Tuomas Sandholm, Rob Shields