2323 search results - page 277 / 465 » Power optimization for connectivity problems |
140
Voted
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Given an n-vertex graph G, a drawing of G in the plane is a mapping of its vertices into points of the plane, and its edges into continuous curves, connecting the images of their ...
124
click to vote
DAM
2007
15 years 3 months ago
2007
We study the problem of uniformly partitioning the edge set of a tree with n edges into k connected components, where k ≤ n. The objective is to minimize the ratio of the maximu...
142
click to vote
ROBOTICA
2002
2002
Point-to-Point trajectory planning of flexible redundant robot manipulators using genetic algorithms
15 years 3 months ago
: The paper focuses on the problem of point-to-point trajectory planning for flexible redundant robot manipulators (FRM) in joint space. Compared with irredundant flexible manipula...
148
click to vote
BROADNETS
2006
IEEE
15 years 10 months ago
2006
IEEE
Internal switches in all-photonic networks do not perform data conversion into the electronic domain, thereby eliminating a potential capacity bottleneck, but the inability to per...
127
click to vote
SIAMDM
2008
15 years 3 months ago
2008
Let G be a connected graph, and let V and V two n-element subsets of its vertex set V (G). Imagine that we place a chip at each element of V and we want to move them into the posi...