1566 search results - page 13 / 314 » Contification Using Dominators |
ICRA
1998
IEEE
14 years 21 days ago
1998
IEEE
In this paper, we propose a 2D visual motion estimation method which can be exploited to achieve a dynamic positioning (eg. by gaze control) with respect to a sea-bottom area of i...
CPAIOR
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. The multiple knapsack problem (MKP) is a classical combinatorial optimization problem. A recent algorithm for some classes of the MKP is bin-completion, a bin-oriented, b...
APPROX
2006
Springer
14 years 5 days ago
2006
Springer
For a given graph with weighted vertices, the goal of the minimum-weight dominating set problem is to compute a vertex subset of smallest weight such that each vertex of the graph...
MANSCI
2006
13 years 8 months ago
2006
Second order stochastic dominance characterizes risk-averse preferences represented by expected utility. This paper supplies second order stochastic dominance conditions that char...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
The measure and conquer approach has proven to be a powerful tool to analyse exact algorithms for combinatorial problems, like Dominating Set and Independent Set. In this paper, we...