Sciweavers

6167 search results - page 1133 / 1234
» Can Refinement be Automated
Sort
View
GECCO
2006
Springer
201views Optimization» more  GECCO 2006»
14 years 1 months ago
Selective self-adaptive approach to ant system for solving unit commitment problem
This paper presents a novel approach to solve the constrained unit commitment problem using Selective Self-Adaptive Ant System (SSAS) for improving search performance by automatic...
Songsak Chusanapiputt, Dulyatat Nualhong, Sujate J...
ISMIR
2000
Springer
146views Music» more  ISMIR 2000»
14 years 1 months ago
Perceptual and Cognitive Applications in Music Information Retrieval
Music librarians and cataloguers have traditionally created indexes that allow users to access musical works using standard reference information, such as the name of the composer...
David Huron
ISSS
1995
IEEE
161views Hardware» more  ISSS 1995»
14 years 1 months ago
Synthesis of pipelined DSP accelerators with dynamic scheduling
To construct complete systems on silicon, application speci c DSP accelerators are needed to speed up the execution of high throughput DSP algorithms. In this paper, a methodology...
Patrick Schaumont, Bart Vanthournout, Ivo Bolsens,...
EDBT
2010
ACM
188views Database» more  EDBT 2010»
14 years 1 months ago
DEDUCE: at the intersection of MapReduce and stream processing
MapReduce and stream processing are two emerging, but different, paradigms for analyzing, processing and making sense of large volumes of modern day data. While MapReduce offers t...
Vibhore Kumar, Henrique Andrade, Bugra Gedik, Kun-...
AIPS
2007
14 years 11 days ago
Context-Aware Logistic Routing and Scheduling
In context-aware route planning, agents have to plan their route on a common infrastructure in such a way that plans made by other agents are not invalidated, and no conflicts ar...
Adriaan ter Mors, Jonne Zutt, Cees Witteveen
« Prev « First page 1133 / 1234 Last » Next »