Sciweavers

944 search results - page 110 / 189
» Heuristic Search for Large Problems With Real Costs
Sort
View
AAAI
2012
13 years 11 days ago
Double-Bit Quantization for Hashing
Hashing, which tries to learn similarity-preserving binary codes for data representation, has been widely used for efficient nearest neighbor search in massive databases due to i...
Weihao Kong, Wu-Jun Li
GECCO
2009
Springer
193views Optimization» more  GECCO 2009»
15 years 2 months ago
Optimization of dynamic memory managers for embedded systems using grammatical evolution
New portable consumer embedded devices must execute multimedia applications (e.g., 3D games, video players and signal processing software, etc.) that demand extensive memory acces...
José L. Risco-Martín, David Atienza,...
ICDE
2006
IEEE
167views Database» more  ICDE 2006»
15 years 11 months ago
Better Burst Detection
A burst is a large number of events occurring within a certain time window. As an unusual activity, it's a noteworthy phenomenon in many natural and social processes. Many da...
Xin Zhang, Dennis Shasha
AUTOMATICA
2008
89views more  AUTOMATICA 2008»
14 years 10 months ago
Dynamic buffer management using optimal control of hybrid systems
This paper studies a general dynamic buffer management problem with one buffer inserted between two interacting components. The component to be controlled is assumed to have multi...
Wei Zhang, Jianghai Hu
ICRA
2008
IEEE
135views Robotics» more  ICRA 2008»
15 years 4 months ago
Path and trajectory diversity: Theory and algorithms
— We present heuristic algorithms for pruning large sets of candidate paths or trajectories down to smaller subsets that maintain desirable characteristics in terms of overall re...
Michael S. Branicky, Ross A. Knepper, James J. Kuf...