Sciweavers

1963 search results - page 108 / 393
» The Maximum Solution Problem on Graphs
Sort
View
ICRA
2003
IEEE
105views Robotics» more  ICRA 2003»
14 years 3 months ago
A computer-aided probing strategy for workpiece localization
This paper presents an optimal planning problem for workpiece measurement. Two sequential optimization algorithms are introduced to find maximum determinant solutions. Then, base...
Zehnhua Xiong, Michael Yu Wang, Zexiang Li
WALCOM
2010
IEEE
255views Algorithms» more  WALCOM 2010»
14 years 5 months ago
Harmonious Coloring on Subclasses of Colinear Graphs
Given a simple graph G, a harmonious coloring of G is a proper vertex coloring such that each pair of colors appears together on at most one edge. The harmonious chromatic number i...
Kyriaki Ioannidou, Stavros D. Nikolopoulos
WG
1998
Springer
14 years 2 months ago
Integral Uniform Flows in Symmetric Networks
We study the integral uniform (multicommodity) flow problem in a graph G and construct a fractional solution whose properties are invariant under the action of a group of automorp...
Farhad Shahrokhi, László A. Sz&eacut...
ICCI
1991
14 years 1 months ago
On the k-Coloring of Intervals
The problem of coloring a set of n intervals (from the real line) with a set of k colors is studied. In such a coloring, two intersecting intervals must receive distinct colors. O...
Martin C. Carlisle, Errol L. Lloyd
IAT
2005
IEEE
14 years 3 months ago
Decomposition Techniques for a Loosely-Coupled Resource Allocation Problem
We are interested by contributing to stochastic problems of which the main distinction is that some tasks may create other tasks. In particular, we present a first approach which...
Pierrick Plamondon, Brahim Chaib-draa, Abder Rezak...