Sciweavers

590 search results - page 74 / 118
» Can We Learn to Beat the Best Stock
Sort
View
SIGECOM
2003
ACM
122views ECommerce» more  SIGECOM 2003»
15 years 3 months ago
On polynomial-time preference elicitation with value queries
Preference elicitation — the process of asking queries to determine parties’ preferences — is a key part of many problems in electronic commerce. For example, a shopping age...
Martin Zinkevich, Avrim Blum, Tuomas Sandholm
IEEEPACT
2009
IEEE
15 years 4 months ago
Using Aggressor Thread Information to Improve Shared Cache Management for CMPs
—Shared cache allocation policies play an important role in determining CMP performance. The simplest policy, LRU, allocates cache implicitly as a consequence of its replacement ...
Wanli Liu, Donald Yeung
WWW
2003
ACM
15 years 10 months ago
A Presentation Architecture for Individualized Content
A modern approach for generating individualized web-sites is to compose a page out of individual elements, for instance XML-fragments, which is eventually transformed to . If the ...
Alberto González Palomo, Carsten Ullrich, P...
GECCO
2004
Springer
15 years 3 months ago
Experimental Evaluation of Discretization Schemes for Rule Induction
This paper proposes an experimental evaluation of various discretization schemes in three different evolutionary systems for inductive concept learning. The various discretization...
Jesús S. Aguilar-Ruiz, Jaume Bacardit, Fede...
ICML
2010
IEEE
14 years 10 months ago
Local Minima Embedding
Dimensionality reduction is a commonly used step in many algorithms for visualization, classification, clustering and modeling. Most dimensionality reduction algorithms find a low...
Minyoung Kim, Fernando De la Torre