Sciweavers

1027 search results - page 11 / 206
» Comparing Search Algorithms for the Temperature Inversion Pr...
Sort
View
SAC
2004
ACM
14 years 1 months ago
Solving the maximum clique problem by k-opt local search
This paper presents a local search algorithm based on variable depth search, called the k-opt local search, for the maximum clique problem. The k-opt local search performs add and...
Kengo Katayama, Akihiro Hamamoto, Hiroyuki Narihis...
WWW
2006
ACM
14 years 8 months ago
CWS: a comparative web search system
In this paper, we define and study a novel search problem: Comparative Web Search (CWS). The task of CWS is to seek relevant and comparative information from the Web to help users...
Jian-Tao Sun, Xuanhui Wang, Dou Shen, Hua-Jun Zeng...
AUSAI
2004
Springer
14 years 1 months ago
An ACO Algorithm for the Most Probable Explanation Problem
We describe an Ant Colony Optimization (ACO) algorithm, ANT-MPE, for the most probable explanation problem in Bayesian network inference. After tuning its parameters settings, we c...
Haipeng Guo, Prashanth R. Boddhireddy, William H. ...
IJCAI
2003
13 years 9 months ago
Contract Algorithms and Robots on Rays: Unifying Two Scheduling Problems
We study two apparently different, but formally similar, scheduling problems. The first problem involves contract algorithms, which can trade off run time for solution quality, a...
Daniel S. Bernstein, Lev Finkelstein, Shlomo Zilbe...
GECCO
2005
Springer
14 years 1 months ago
Interactive estimation of agent-based financial markets models: modularity and learning
Building upon the interactive inversion method introduced by Ashburn and Bonabeau (2004), we show how to dramatically improve the results by exploiting modularity and by letting t...
M. Ihsan Ecemis, Eric Bonabeau, Trent Ashburn