2194 search results - page 12 / 439 » Improving HLRTA*( k ) |
132
click to vote
COCOON
2005
Springer
15 years 11 months ago
2005
Springer
The maximum subarray problem for a one- or two-dimensional array is to find the array portion that maiximizes the sum of array elements in it. The K-maximum subarray problem is to...
179
click to vote
ECAI
2004
Springer
15 years 11 months ago
2004
Springer
A Bayesian network is an appropriate tool to deal with the uncertainty that is typical of real-life applications. Bayesian network arcs represent statistical dependence between dif...
136
click to vote
ISAAC
2005
Springer
15 years 11 months ago
2005
Springer
Given a sequence of n real numbers and an integer k, 1 k 1 2 n(n − 1), the k maximum-sum segments problem is to locate the k segments whose sums are the k largest among all poss...
159
click to vote
APPROX
2009
Springer
16 years 19 days ago
2009
Springer
We study the maximization version of the fundamental graph coloring problem. Here the goal is to color the vertices of a k-colorable graph with k colors so that a maximum fraction ...