Sciweavers

1404 search results - page 68 / 281
» Optimization problems in multiple-interval graphs
Sort
View
ERSHOV
1999
Springer
15 years 2 months ago
Multi-agent Optimal Path Planning for Mobile Robots in Environment with Obstacles
Abstract. The paper describes a problem of multi-agent path planning in environment with obstacles. Novel approach to multi-agent optimal path planning, using graph representation ...
Fedor A. Kolushev, Alexander A. Bogdanov
ISSS
1995
IEEE
100views Hardware» more  ISSS 1995»
15 years 1 months ago
Optimal code generation for embedded memory non-homogeneous register architectures
This paper examines the problem of code-generation for expression trees on non-homogeneous register set architectures. It proposes and proves the optimality of an O(n) algorithm f...
Guido Araujo, Sharad Malik
CATS
2006
14 years 11 months ago
Graph Orientation Algorithms to Minimize the Maximum Outdegree
We study the problem of orienting the edges of a weighted graph such that the maximum weighted outdegree of vertices is minimized. This problem, which has applications in the guar...
Yuichi Asahiro, Eiji Miyano, Hirotaka Ono, Kouhei ...
ICMCS
2007
IEEE
203views Multimedia» more  ICMCS 2007»
15 years 4 months ago
Efficient Video Object Segmentation by Graph-Cut
Segmentation of video objects from background is a popular computer vision problem and has many important applications. Most existing methods are either computationally expensive ...
Jinjun Wang, Wei Xu, Shenghuo Zhu, Yihong Gong
SDM
2007
SIAM
143views Data Mining» more  SDM 2007»
14 years 11 months ago
Clustering by weighted cuts in directed graphs
In this paper we formulate spectral clustering in directed graphs as an optimization problem, the objective being a weighted cut in the directed graph. This objective extends seve...
Marina Meila, William Pentney