Sciweavers

76 search results - page 2 / 16
» On a Network Generalization of the Minmax Theorem
Sort
View
SCL
2008
96views more  SCL 2008»
13 years 5 months ago
Min-Max MPC based on a network problem
In general, min
Teodoro Alamo, David Muñoz de la Peñ...
ISNN
2010
Springer
13 years 4 months ago
Pruning Training Samples Using a Supervised Clustering Algorithm
As practical pattern classification tasks are often very-large scale and serious imbalance such as patent classification, using traditional pattern classification techniques in ...
Minzhang Huang, Hai Zhao, Bao-Liang Lu
FOCS
2004
IEEE
13 years 9 months ago
An Approximate Max-Steiner-Tree-Packing Min-Steiner-Cut Theorem
Given an undirected multigraph G and a subset of vertices S V (G), the STEINER TREE PACKING problem is to find a largest collection of edge-disjoint trees that each connects S. T...
Lap Chi Lau
MFCS
2005
Springer
13 years 11 months ago
D-Width: A More Natural Measure for Directed Tree Width
Due to extensive research on tree-width for undirected graphs and due to its many applications in various fields it has been a natural desire for many years to generalize the idea...
Mohammad Ali Safari
CDC
2008
IEEE
147views Control Systems» more  CDC 2008»
14 years 7 days ago
Applications of the general Lyapunov ISS small-gain theorem for networks
Abstract— In the framework of the ISS Lyapunov formulation a small gain theorem has recently been proved which allows the explicit construction of Lyapunov functions for intercon...
Sergey Dashkovskiy, Björn Rüffer, Fabian...