Sciweavers

6943 search results - page 1322 / 1389
» Representations for evolutionary algorithms
Sort
View
IQIS
2005
ACM
15 years 9 months ago
Exploiting relationships for object consolidation
Researchers in the data mining area frequently have to spend significant portion of their time on preprocessing the data in order to apply their algorithms to real-world datasets...
Zhaoqi Chen, Dmitri V. Kalashnikov, Sharad Mehrotr...
SIGIR
2005
ACM
15 years 9 months ago
Surrogate scoring for improved metasearch precision
We describe a method for improving the precision of metasearch results based upon scoring the visual features of documents' surrogate representations. These surrogate scores ...
Steven M. Beitzel, Eric C. Jensen, Ophir Frieder, ...
SIGMETRICS
2005
ACM
118views Hardware» more  SIGMETRICS 2005»
15 years 9 months ago
Nearly insensitive bounds on SMART scheduling
We define the class of SMART scheduling policies. These are policies that bias towards jobs with small remaining service times, jobs with small original sizes, or both, with the ...
Adam Wierman, Mor Harchol-Balter, Takayuki Osogami
VEE
2005
ACM
199views Virtualization» more  VEE 2005»
15 years 9 months ago
Escape analysis in the context of dynamic compilation and deoptimization
In object-oriented programming languages, an object is said to escape the method or thread in which it was created if it can also be accessed by other methods or threads. Knowing ...
Thomas Kotzmann, Hanspeter Mössenböck
CIKM
2005
Springer
15 years 9 months ago
Optimizing candidate check costs for bitmap indices
In this paper, we propose a new strategy for optimizing the placement of bin boundaries to minimize the cost of query evaluation using bitmap indices with binning. For attributes ...
Doron Rotem, Kurt Stockinger, Kesheng Wu
« Prev « First page 1322 / 1389 Last » Next »