Sciweavers

11129 search results - page 105 / 2226
» Modeling Search Computing Applications
Sort
View
78
Voted
GECCO
2007
Springer
193views Optimization» more  GECCO 2007»
15 years 4 months ago
Approximating covering problems by randomized search heuristics using multi-objective models
The main aim of randomized search heuristics is to produce good approximations of optimal solutions within a small amount of time. In contrast to numerous experimental results, th...
Tobias Friedrich, Nils Hebbinghaus, Frank Neumann,...
SIGIR
2009
ACM
15 years 4 months ago
Personalized music emotion recognition
In recent years, there has been a dramatic proliferation of research on information retrieval based on highly subjective concepts such as emotion, preference and aesthetic. Such r...
Yi-Hsuan Yang, Yu-Ching Lin, Homer H. Chen
ICCD
2008
IEEE
126views Hardware» more  ICCD 2008»
15 years 4 months ago
Accelerating search and recognition with a TCAM functional unit
Abstract— World data is increasing rapidly, doubling almost every three years[1][2]. To comprehend and use this data effectively, search and recognition (SR) applications will de...
Atif Hashmi, Mikko Lipasti
159
Voted
ICSE
2012
IEEE-ACM
13 years 17 days ago
Detecting similar software applications
—Although popular text search engines allow users to retrieve similar web pages, source code search engines do not have this feature. Detecting similar applications is a notoriou...
Collin McMillan, Mark Grechanik, Denys Poshyvanyk
CPAIOR
2008
Springer
14 years 12 months ago
Leveraging Belief Propagation, Backtrack Search, and Statistics for Model Counting
We consider the problem of estimating the model count (number of solutions) of Boolean formulas, and present two techniques that compute estimates of these counts, as well as eith...
Lukas Kroc, Ashish Sabharwal, Bart Selman