Sciweavers

1632 search results - page 160 / 327
» Sublinear Time Algorithms for Metric Space Problems
Sort
View
GECCO
2009
Springer
156views Optimization» more  GECCO 2009»
15 years 10 months ago
Articulating user preferences in many-objective problems by sampling the weighted hypervolume
The hypervolume indicator has become popular in recent years both for performance assessment and to guide the search of evolutionary multiobjective optimizers. Two critical resear...
Anne Auger, Johannes Bader, Dimo Brockhoff, Eckart...
JUCS
2006
112views more  JUCS 2006»
15 years 4 months ago
A Multi-objective Genetic Approach to Mapping Problem on Network-on-Chip
Abstract: Advances in technology now make it possible to integrate hundreds of cores (e.g. general or special purpose processors, embedded memories, application specific components...
Giuseppe Ascia, Vincenzo Catania, Maurizio Palesi
ICDE
2010
IEEE
248views Database» more  ICDE 2010»
16 years 3 months ago
FPGA Acceleration for the Frequent Item Problem
Abstract-- Field-programmable gate arrays (FPGAs) can provide performance advantages with a lower resource consumption (e.g., energy) than conventional CPUs. In this paper, we show...
Gustavo Alonso, Jens Teubner, René Mül...
VLSISP
2011
358views Database» more  VLSISP 2011»
14 years 11 months ago
Accelerating Machine-Learning Algorithms on FPGAs using Pattern-Based Decomposition
Machine-learning algorithms are employed in a wide variety of applications to extract useful information from data sets, and many are known to suffer from superlinear increases in ...
Karthik Nagarajan, Brian Holland, Alan D. George, ...
IJCAI
2007
15 years 5 months ago
A Heuristic Search Approach to Planning with Temporally Extended Preferences
In this paper we propose a suite of techniques for planning with temporally extended preferences (TEPs). To this end, we propose a method for compiling TEP planning problems into ...
Jorge A. Baier, Fahiem Bacchus, Sheila A. McIlrait...