Sciweavers

1639 search results - page 128 / 328
» Anytime Heuristic Search
Sort
View
WIDM
2006
ACM
14 years 4 months ago
Identifying redundant search engines in a very large scale metasearch engine context
For a given set of search engines, a search engine is redundant if its searchable contents can be found from other search engines in this set. In this paper, we propose a method t...
Ronak Desai, Qi Yang, Zonghuan Wu, Weiyi Meng, Cle...
ATAL
2008
Springer
14 years 5 days ago
Cooperative search for optimizing pipeline operations
We present an application of a multi-agent cooperative search approach to the problem of optimizing gas pipeline operations, i.e. finding control parameters for a gas transmission...
T. Mora, Abu B. Sesay, Jörg Denzinger, Hossei...
EVOW
2008
Springer
13 years 12 months ago
Reactive Stochastic Local Search Algorithms for the Genomic Median Problem
Abstract. The genomic median problem is an optimization problem inspired by a biological issue: it aims at finding the chromosome organization of the common ancestor to multiple li...
Renaud Lenne, Christine Solnon, Thomas Stützl...
ADHOC
2007
101views more  ADHOC 2007»
13 years 10 months ago
Searching strategies for target discovery in wireless networks
— In this paper, we address a fundamental problem concerning the optimal searching strategy in terms of searching cost for the target discovery problem in wireless networks. In o...
Zhao Cheng, Wendi B. Heinzelman
WEA
2004
Springer
128views Algorithms» more  WEA 2004»
14 years 3 months ago
GRASP with Path-Relinking for the Quadratic Assignment Problem
This paper describes a GRASP with path-relinking heuristic for the quadratic assignment problem. GRASP is a multi-start procedure, where different points in the search space are p...
Carlos A. S. Oliveira, Panos M. Pardalos, Mauricio...