5316 search results - page 74 / 1064 » Which Search Problems Are Random |
116
click to vote
IJCAI
2001
15 years 2 months ago
2001
New methods to generate hard random problem instances have driven progress on algorithms for deduction and constraint satisfaction. Recently Achlioptas et al. (AAAI 2000) introduc...
COMPGEOM
2003
ACM
15 years 6 months ago
2003
ACM
Randomized incremental constructions are widely used in computational geometry, but they perform very badly on large data because of their inherently random memory access patterns...
128
click to vote
LION
2007
Springer
15 years 7 months ago
2007
Springer
The importance of tuning a search algorithm for the specific features of the target search space has been known for quite some time. However, when dealing with multiobjective prob...
COR
2007
15 years 27 days ago
2007
An NP-hard production–distribution problem for one product over a multi-period horizon is investigated. The aim is to minimize total cost taking production setups, inventory lev...
ISAAC
2003
Springer
15 years 6 months ago
2003
Springer
Given k sorted arrays, the t-Threshold problem, which is motivated by indexed search engines, consists of finding the elements which are present in at least t of the arrays. We pr...