5316 search results - page 83 / 1064 » Which Search Problems Are Random |
113
click to vote
FOCS
2007
IEEE
15 years 7 months ago
2007
IEEE
Submodular maximization generalizes many important problems including Max Cut in directed/undirected graphs and hypergraphs, certain constraint satisfaction problems and maximum f...
101
click to vote
EOR
2008
15 years 1 months ago
2008
We suggest a new heuristic for solving unconstrained continuous optimization problems. It is based on a generalized version of the variable neighborhood search metaheuristic. Diff...
104
click to vote
ICPR
2006
IEEE
15 years 7 months ago
2006
IEEE
In this paper, we propose a learning-based method for video super-resolution. There are two main contributions of the proposed method. First, information from cameras with differe...
123
click to vote
SAT
2010
Springer
14 years 11 months ago
2010
Springer
This paper presents a detailed empirical study of local search for Boolean satisfiability (SAT), highlighting several interesting properties, some of which were previously unknown...
IPPS
1998
IEEE
15 years 5 months ago
1998
IEEE
In this abstract, we provide an overview of our survey of randomized techniques for exploiting the parallelism in string matching problems. Broadly, the study of string matching fa...