2109 search results - page 98 / 422 » Solving Necklace Constraint Problems |
159
Voted
CPAIOR
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. This paper introduces a problem called the temporal knapsack problem, presents several algorithms for solving it, and compares their performance. The temporal knapsack pr...
138
click to vote
AAAI
2008
15 years 7 months ago
2008
In this paper, we study a sequential decision making problem. The objective is to maximize the average reward accumulated over time subject to temporal cost constraints. The novel...
162
click to vote
AAIM
2006
Springer
15 years 11 months ago
2006
Springer
Abstract. We study an extension of the set cover problem, the connected set cover problem, the problem is to find a set cover of minimal size that satisfies some connectivity con...
155
click to vote
ICTAI
2003
IEEE
2003
IEEE
Partitioning of Temporal Planning Problems in Mixed Space Using the Theory of Extended Saddle Points
15 years 10 months ago
We study the partitioning of temporal planning problems formulated as mixed-integer nonlinear programming problems, develop methods to reduce the search space of partitioned subpr...
137
Voted
BMVC
1997
15 years 6 months ago
1997
A new geometrical approach in solving the shape from shading problem of Lambertian model is discussed. It is shown that this problem is bound by two local constraints through the ...