4843 search results - page 203 / 969 » The Shortcut Problem - Complexity and Approximation |
113
click to vote
EOR
2008
15 years 3 months ago
2008
The car sequencing problem consists in sequencing a given set of cars to be produced in a single day. We address one of the variants of this problem, in which the objective of mini...
134
Voted
ICIP
2005
IEEE
16 years 5 months ago
2005
IEEE
In this paper the blind deconvolution problem is formulated using the variational framework. With its use approximations of the involved probability distributions are developed re...
114
Voted
IWPEC
2009
Springer
15 years 10 months ago
2009
Springer
The bandwidth of a graph G on n vertices is the minimum b such that the vertices of G can be labeled from 1 to n such that the labels of every pair of adjacent vertices differ by ...
173
click to vote
WADS
2007
Springer
15 years 9 months ago
2007
Springer
Range searching is a well known problem in the area of geometric data structures. We consider this problem in the context of approximation, where an approximation parameter ε >...
121
click to vote
ECML
2004
Springer
15 years 8 months ago
2004
Springer
HEXQ is a reinforcement learning algorithm that discovers hierarchical structure automatically. The generated task hierarchy repthe problem at different levels of abstraction. In ...