Sciweavers

91 search results - page 13 / 19
» All Things Being Equal
Sort
View
TRS
2008
13 years 6 months ago
Local and Global Approximations for Incomplete Data
Abstract. For completely specified decision tables lower and upper approximations are unique, the lower approximation is the largest definable set contained in the approximated set...
Jerzy W. Grzymala-Busse, Wojciech Rzasa
HEURISTICS
1998
252views more  HEURISTICS 1998»
13 years 6 months ago
Constraint Handling in Genetic Algorithms: The Set Partitioning Problem
In this paper we present a genetic algorithm-based heuristic for solving the set partitioning problem (SPP). The SPP is an important combinatorial optimisation problem used by man...
P. C. Chu, J. E. Beasley
PVLDB
2008
124views more  PVLDB 2008»
13 years 6 months ago
Scheduling shared scans of large data files
We study how best to schedule scans of large data files, in the presence of many simultaneous requests to a common set of files. The objective is to maximize the overall rate of p...
Parag Agrawal, Daniel Kifer, Christopher Olston
TCS
2010
13 years 5 months ago
Active learning in heteroscedastic noise
We consider the problem of actively learning the mean values of distributions associated with a finite number of options. The decision maker can select which option to generate t...
András Antos, Varun Grover, Csaba Szepesv&a...
CVPR
2011
IEEE
1506views Computer Vision» more  CVPR 2011»
13 years 2 months ago
What makes an image memorable?
When glancing at a magazine, or browsing the Internet, we are continuously being exposed to photographs. Despite of this overflow of visual information, humans are extremely good...
Phillip Isola, Jianxiong Xiao, Aude Oliva, Antonio...