Sciweavers

3415 search results - page 600 / 683
» Lower Bounds for Kernelizations
Sort
View
CDC
2010
IEEE
181views Control Systems» more  CDC 2010»
13 years 5 months ago
Relationship between power loss and network topology in power systems
This paper is concerned with studying how the minimum power loss in a power system is related to its network topology. The existing algorithms in the literature all exploit nonline...
Javad Lavaei, Steven H. Low
CORR
2011
Springer
145views Education» more  CORR 2011»
13 years 5 months ago
Global Search Based on Efficient Diagonal Partitions and a set of Lipschitz Constants
In the paper, the global optimization problem of a multidimensional “black-box” function satisfying the Lipschitz condition over a hyperinterval with an unknown Lipschitz const...
Yaroslav D. Sergeyev, Dmitri E. Kvasov
CORR
2011
Springer
200views Education» more  CORR 2011»
13 years 5 months ago
Optimal Channel Training in Uplink Network MIMO Systems
We consider a multi-cell frequency-selective fading uplink channel (network MIMO) from K singleantenna user terminals (UTs) to B cooperative base stations (BSs) with M antennas ea...
Jakob Hoydis, Mari Kobayashi, Mérouane Debb...
DAM
2011
13 years 5 months ago
A study of 3-arc graphs
An arc of a graph is an oriented edge and a 3-arc is a 4-tuple (v, u, x, y) of vertices such that both (v, u, x) and (u, x, y) are paths of length two. The 3-arc graph of a graph ...
Martin Knor, Guangjun Xu, Sanming Zhou
JCT
2011
84views more  JCT 2011»
13 years 5 months ago
Enumerating isodiametric and isoperimetric polygons
For a positive integer n that is not a power of 2, precisely the same family of convex polygons with n sides is optimal in three different geometric problems. These polygons have ...
Michael J. Mossinghoff