Sciweavers

6976 search results - page 174 / 1396
» The Oil Searching Problem
Sort
View
INFOCOM
2006
IEEE
16 years 16 days ago
Controlled Flooding Search with Delay Constraints
— In this paper we consider the problem of query and search in a network, e.g., searching for a specific node or a piece of data. We limit our attention to the class of TTL (tim...
Nicholas B. Chang, Mingyan Liu
CEC
2005
IEEE
16 years 4 days ago
Adaptive local search parameters for real-coded memetic algorithms
AbstractThis paper presents a real-coded memetic algorithm that combines a high diversity global exploration with an adaptive local search method to the most promising individuals ...
Daniel Molina, Francisco Herrera, Manuel Lozano
WIOPT
2005
IEEE
16 years 2 days ago
Optimal Controlled Flooding Search in a Large Wireless Network
In this paper we consider the problem of searching for a node or an object (i.e., piece of data, file, etc.) in a large wireless network. We consider the class of controlled flo...
Nicholas B. Chang, Mingyan Liu
VLDB
2005
ACM
144views Database» more  VLDB 2005»
15 years 12 months ago
Bidirectional Expansion For Keyword Search on Graph Databases
Relational, XML and HTML data can be represented as graphs with entities as nodes and relationships as edges. Text is associated with nodes and possibly edges. Keyword search on s...
Varun Kacholia, Shashank Pandit, Soumen Chakrabart...
AAAI
2000
15 years 7 months ago
Depth-First Branch-and-Bound versus Local Search: A Case Study
Depth-first branch-and-bound (DFBnB) is a complete algorithm that is typically used to find optimal solutions of difficult combinatorial optimization problems. It can also be adap...
Weixiong Zhang