1529 search results - page 39 / 306 » Search Space Analysis of the Linear Ordering Problem |
124
Voted
ACL
2010
15 years 1 months ago
2010
Incremental parsing techniques such as shift-reduce have gained popularity thanks to their efficiency, but there remains a major problem: the search is greedy and only explores a ...
134
Voted
UAI
2001
15 years 5 months ago
2001
We propose a new approach to value-directed belief state approximationfor POMDPs. The valuedirected model allows one to choose approximation methods for belief state monitoringtha...
123
Voted
GECCO
2000
Springer
15 years 7 months ago
2000
Springer
In Real coded genetic algorithms, some crossover operators do not work well on functions which have their optimum at the corner of the search space. To cope with this problem, we ...
185
Voted
COMPGEOM
2010
ACM
15 years 8 months ago
2010
ACM
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
150
Voted
PPSN
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. There is a variety of methods for ranking objectives in multiobjective optimization and some are difficult to define because they require information a priori (e.g. esta...