5316 search results - page 2 / 1064 » Which Search Problems Are Random |
109
click to vote
DKE
2002
15 years 14 days ago
2002
An important issue in data warehouse development is the selection of a set of views to materialize in order to accelerate OLAP queries, given certain space and maintenance time co...
95
Voted
EVOW
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. The Linear Ordering Problem (LOP) is an NP-hard combinatorial optimization problem that arises in a variety of applications and several algorithmic approaches to its solu...
112
Voted
CSCLP
2004
Springer
15 years 6 months ago
2004
Springer
We propose an improved restart strategy for randomized backtrack search, and evaluate its performance by comparing to other heuristic and stochastic search techniques for solving r...
106
Voted
AMAI
1999
Springer
15 years 10 days ago
1999
Springer
The paper focuses on evaluating constraint satisfaction search algorithms on application based random problem instances. The application we use is a well-studied problem in the el...
91
Voted
CADE
2008
Springer
16 years 29 days ago
2008
Springer
Abstract. We present randoCoP, a theorem prover for classical firstorder logic, which integrates randomized search techniques into the connection prover leanCoP 2.0. By randomly re...