6976 search results - page 250 / 1396 » The Oil Searching Problem |
164
click to vote
WEBI
2005
Springer
16 years 3 days ago
2005
Springer
Due to the enormous size of the web and low precision of user queries, finding the right information from the web can be difficult if not impossible. One approach that tries to ...
168
click to vote
CEC
2007
IEEE
15 years 10 months ago
2007
IEEE
Routing in computer networks is a nonlinear combinatorial optimization problem with numerous constraints and is classified as an NP-complete problem. There are certain important Qo...
172
click to vote
ECAI
2008
Springer
15 years 8 months ago
2008
Springer
While stochastic local search (SLS) techniques are very efficient in solving hard randomly generated propositional satisfiability (SAT) problem instances, a major challenge is to i...
173
click to vote
ANTSW
2008
Springer
15 years 7 months ago
2008
Springer
Abstract. Ant colony optimization (ACO) is a metaheuristic that produces good results for a wide range of combinatorial optimization problems. Often such successful applications us...
160
click to vote
CORIA
2009
15 years 7 months ago
2009
The aggregated search assembles in one interface information from different sources. It deals with different types of content (text, video, image, etc) and granularities of retriev...