617 search results - page 93 / 124 » Local Search for Heuristic Guidance in Tree Search |
IWPEC
2009
Springer
14 years 2 months ago
2009
Springer
Many parameterized algorithms for NP-hard graph problems are search tree algorithms with sophisticated local branching rules. But it has also been noticed that the global structur...
COMPSAC
2002
IEEE
14 years 29 days ago
2002
IEEE
Services for locating mobile objects are often organized as a distributed search tree. The advantage of such an organization is that the service can easily scale as a distributed ...
COLING
2002
13 years 7 months ago
2002
Ambiguity is very high for location names. For example, there are 23 cities named `Buffalo' in the U.S. Country names such as `Canada', `Brazil' and `China' ar...
ICDE
2012
IEEE
11 years 10 months ago
2012
IEEE
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
CLEF
2009
Springer
13 years 9 months ago
2009
Springer
This paper presents the participation of the semantic N-levels search engine SENSE at the CLEF 2009 Ad Hoc Robust-WSD Task. During the participation at the same task of CLEF 2008,...