4266 search results - page 241 / 854 » The container loading problem |
128
click to vote
AAAI
2000
15 years 5 months ago
2000
We present a new algorithm that reduces the space complexity of heuristic search. It is most effective for problem spaces that grow polynomially with problem size, but contain lar...
127
click to vote
WALCOM
2007
IEEE
15 years 5 months ago
2007
IEEE
In this paper, we consider the pattern matching problem in DNA and RNA sequences where either the pattern or the text can be degenerate i.e. contain sets of characters. We present ...
126
click to vote
MST
2008
15 years 4 months ago
2008
We investigate the complexity of the satisfiability problem of constraints over finite totally ordered domains. In our context, a clausal constraint is a disjunction of inequaliti...
138
click to vote
ICIP
2010
IEEE
15 years 2 months ago
2010
IEEE
This paper addresses the problem of joint decoding of stereo JPEG image pairs. Such images typically contain a high degree of redundancy. Predictive coding could efficiently captu...
129
click to vote
SIAMCOMP
2010
14 years 11 months ago
2010
The (undirected) Steiner Network problem is: given a graph = ( , ) with edge/node-weights and edge-connectivity requirements { ( , ) : , }, find a minimumweight subgraph of conta...