1723 search results - page 245 / 345 » Cycling in linear programming problems |
ICPR
2008
IEEE
15 years 4 months ago
2008
IEEE
Graph cut algorithms (i.e., min s-t cuts) [3][10][15] are useful in many computer vision applications. In this paper we develop a formulation that allows the addition of side cons...
ICRA
2008
IEEE
15 years 4 months ago
2008
IEEE
— In this paper, we propose a new approach for computing force-closure grasps of two-dimensional and threedimensional objects. Assuming n hard-finger contact with Coulomb fricti...
CEC
2007
IEEE
15 years 4 months ago
2007
IEEE
Abstract— We present a novel algorithm for the onedimension offline bin packing problem with discrete item sizes based on the notion of matching the item-size histogram with the...
WINE
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. We consider the problem of computing additively approximate Nash equilibria in non-cooperative two-player games. We provide a new polynomial time algorithm that achieves ...
GLOBECOM
2006
IEEE
15 years 3 months ago
2006
IEEE
The emergence of multi-channel multi-radio wireless mesh networks has given us many new opportunities and challenges. Particularly, the issue on how to appropriately assign channel...