Sciweavers

5316 search results - page 268 / 1064
» Which Search Problems Are Random
Sort
View
139
Voted
CP
2004
Springer
15 years 10 months ago
Backtrack-Free Search for Real-Time Constraint Satisfaction
A constraint satisfaction problem (CSP) model can be preprocessed to ensure that any choices made will lead to solutions, without the need to backtrack. This can be especially usef...
J. Christopher Beck, Tom Carchrae, Eugene C. Freud...
CCCG
2001
15 years 6 months ago
Nearest neighbor search through function minimization
This paper describes a solution to the nearest neighbor problem. The proposed algorithm, which makes use of the triangle inequality property, is considered from a function minimiz...
Chang Shu, Michael A. Greenspan, Guy Godin
CI
2007
124views more  CI 2007»
15 years 5 months ago
Searching for Explanatory Web Pages Using Automatic Query Expansion
: When one tries to use the Web as a dictionary or encyclopedia, entering some single term into a search engine, the highly-ranked pages in the result can include irrelevant or use...
Manabu Tauchi, Nigel Ward
SASO
2007
IEEE
15 years 11 months ago
Improving ICE Service Selection in a P2P System using the Gradient Topology
Internet Connectivity Establishment (ICE) is becoming increasingly important for P2P systems on the open Internet, as it enables NAT-bound peers to provide accessible services. A ...
Jim Dowling, Jan Sacha, Seif Haridi
356
Voted
JNCA
2011
281views more  JNCA 2011»
14 years 7 months ago
A link stability-based multicast routing protocol for wireless mobile ad hoc networks
  Recently, several studies have been conducted to design mobility‐based multicast routing protocols for    wireless mobile ad hoc networks (MANET). These ...
Javad Akbari Torkestani, Mohammad Reza Meybodi