5316 search results - page 67 / 1064 » Which Search Problems Are Random |
123
click to vote
DAM
2000
15 years 19 days ago
2000
Feedback problems consist of removing a minimal number of vertices of a directed or undirected graph in order to make it acyclic. The problem is known to be NPcomplete. In this pa...
111
click to vote
CCGRID
2010
IEEE
15 years 1 months ago
2010
IEEE
Abstract--Resource discovery is a challenging issue in unstructured peer-to-peer networks. Blind search approaches, including flooding and random walks, are the two typical algorit...
113
click to vote
ICS
2010
Tsinghua U.
15 years 10 months ago
2010
Tsinghua U.
In this paper we study the possibility of proving the existence of one-way functions based on average case hardness. It is well-known that if there exists a polynomial-time sample...
104
click to vote
IBERAMIA
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. In constraint satisfaction, a general rule is to tackle the hardest part of a search problem first. In this paper, we introduce a parameter (τ) that measures the constr...
113
click to vote
CEC
2009
IEEE
15 years 7 months ago
2009
IEEE
— Capacitated Arc Routing Problem (CARP) has attracted much interest because of its wide applications in the real world. Recently, a memetic algorithm proposed by Lacomme et al. ...