Sciweavers

1090 search results - page 70 / 218
» Priority Algorithms for Graph Optimization Problems
Sort
View
ERSHOV
1999
Springer
15 years 6 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 5 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
103
Voted
IPMI
2005
Springer
16 years 3 months ago
Simultaneous Segmentation of Multiple Closed Surfaces Using Optimal Graph Searching
This paper presents a general graph-theoretic technique for simultaneously segmenting multiple closed surfaces in volumetric images, which employs a novel graph-construction scheme...
Kang Li, Steven Millington, Xiaodong Wu, Danny Z. ...
JMLR
2006
125views more  JMLR 2006»
15 years 2 months ago
Efficient Learning of Label Ranking by Soft Projections onto Polyhedra
We discuss the problem of learning to rank labels from a real valued feedback associated with each label. We cast the feedback as a preferences graph where the nodes of the graph ...
Shai Shalev-Shwartz, Yoram Singer
116
Voted
SDM
2007
SIAM
143views Data Mining» more  SDM 2007»
15 years 3 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