5316 search results - page 118 / 1064 » Which Search Problems Are Random |
101
Voted
ECCC
2006
15 years 3 months ago
2006
Ant Colony Optimization (ACO) has become quite popular in recent years. In contrast to many successful applications, the theoretical foundation of this randomized search heuristic...
160
click to vote
MSWIM
2006
ACM
15 years 9 months ago
2006
ACM
In recent years different authors have proposed the used of random-walk-based algorithms for varying tasks in the networking community. These proposals include searching, routing...
132
Voted
HM
2007
Springer
15 years 7 months ago
2007
Springer
Optimization in sports is a field of increasing interest. A novel problem in sports management is the Referee Assignment Problem, in which a limited number of referees with differe...
153
Voted
COLOGNETWENTE
2010
15 years 5 days ago
2010
Given a bipartite graph G = (S, T, E), we consider the problem of finding k bipartite subgraphs, called "clusters", such that each vertex i of S appears in exactly one o...
160
Voted
FOCS
2008
IEEE
15 years 10 months ago
2008
IEEE
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...