1064 search results - page 97 / 213 » Exact Algorithms for the Quadratic Linear Ordering Problem |
126
click to vote
CVPR
2012
IEEE
13 years 6 months ago
2012
IEEE
We present an iterative approximate solution to the multidimensional assignment problem under general cost functions. The method maintains a feasible solution at every step, and i...
151
click to vote
IJCAI
2007
15 years 5 months ago
2007
In distributed combinatorial optimization problems, dynamic programming algorithms like DPOP ([Petcu and Faltings, 2005]) require only a linear number of messages, thus generating...
147
click to vote
CAL
2002
15 years 4 months ago
2002
This paper presents an algorithm to find a worst-case traffic pattern for any oblivious routing algorithm on an arbitrary interconnection network topology. The linearity of channe...
152
click to vote
WEA
2007
Springer
15 years 10 months ago
2007
Springer
For trunk packing problems only few approximation schemes are known, mostly designed for the European standard DIN 70020 [6] with equally sized boxes [8, 9, 11, 12]. In this paper ...
121
click to vote
IJCAI
2007
15 years 5 months ago
2007
We propose a novel approach to the problem of simultaneous localization and mapping (SLAM) based on incremental smoothing, that is suitable for real-time applications in large-sca...