5316 search results - page 80 / 1064 » Which Search Problems Are Random |
99
Voted
BERTINORO
2005
Springer
15 years 6 months ago
2005
Springer
Decentralized peer to peer (p2p) networks like Gnutella are attractive for certain applications because they require no centralized directories and no precise control over network ...
131
Voted
COLOGNETWENTE
2010
14 years 11 months ago
2010
We present an algorithm for the independent set problem on semi-random graphs, which are generated as follows: An adversary chooses an n-vertex graph, and then each edge is flipp...
123
Voted
GECCO
2003
Springer
15 years 6 months ago
2003
Springer
The Linear Ordering Problem(LOP), which is a well-known NP-hard problem, has numerous applications in various fields. Using this problem as an example, we illustrate a general pro...
123
Voted
CP
1999
Springer
15 years 5 months ago
1999
Springer
A lot of work in constraint satisfaction has been focused on finding solutions to difficult problems. Many real life problems however, while not extremely complicated, have a huge...
114
Voted
EOR
2008
15 years 1 months ago
2008
This article describes and compares three heuristics for a variant of the Steiner tree problem with revenues, which includes budget and hop constraints. First, a greedy method whi...