Sciweavers

1568 search results - page 183 / 314
» The problem of examination questions in algorithmics
Sort
View
POPL
2010
ACM
16 years 1 months ago
Compress-and-conquer for optimal multicore computing
We propose a programming paradigm called compress-and-conquer (CC) that leads to optimal performance on multicore platforms. Given a multicore system of p cores and a problem of s...
Zhijing G. Mou, Hai Liu, Paul Hudak
GECCO
2007
Springer
163views Optimization» more  GECCO 2007»
16 years 17 days ago
Effects of the use of non-geometric binary crossover on evolutionary multiobjective optimization
In the design of evolutionary multiobjective optimization (EMO) algorithms, it is important to strike a balance between diversity and convergence. Traditional mask-based crossover...
Hisao Ishibuchi, Yusuke Nojima, Noritaka Tsukamoto...
SIGECOM
2009
ACM
114views ECommerce» more  SIGECOM 2009»
16 years 28 days ago
Policy teaching through reward function learning
Policy teaching considers a Markov Decision Process setting in which an interested party aims to influence an agent’s decisions by providing limited incentives. In this paper, ...
Haoqi Zhang, David C. Parkes, Yiling Chen
SSDBM
2007
IEEE
104views Database» more  SSDBM 2007»
16 years 20 days ago
Reservoir Sampling over Memory-Limited Stream Joins
In stream join processing with limited memory, uniform random sampling is useful for approximate query evaluation. In this paper, we address the problem of reservoir sampling over...
Mohammed Al-Kateb, Byung Suk Lee, Xiaoyang Sean Wa...
ICDE
2000
IEEE
144views Database» more  ICDE 2000»
15 years 10 months ago
Practical Lineage Tracing in Data Warehouses
We consider the view data lineage problem in a warehousing environment: For a given data item in a materialized warehouse view, we want to identify the set of source data items th...
Yingwei Cui, Jennifer Widom