Sciweavers

3702 search results - page 133 / 741
» All Pairings Are in a Group
Sort
View
IPPS
1999
IEEE
15 years 10 months ago
A Parallel Algorithm for Bound-Smoothing
Determining molecular structure from interatomic distances is an important and challenging problem. Given a molecule with n atoms, lower and upper bounds on interatomic distances ...
Kumar Rajan, Narsingh Deo
WCE
2007
15 years 7 months ago
Models of Adding Relations to a Linking Pin Type Organization Structure
—This paper proposes two models of adding relations to a linking pin type organization structure where every pair of siblings in a complete Kary tree of height H is adjacent: (i)...
Kiyoshi Sawada
AUTOMATICA
2007
62views more  AUTOMATICA 2007»
15 years 6 months ago
Further results on structural assignment of linear systems via sensor selection
The problem of assigning structural properties of a linear system through sensor selection is, for a given pair (A, B), to find an output pair (C, D) such that the resulting syst...
Xinmin Liu, Zongli Lin, Ben M. Chen
AUTOMATICA
2008
89views more  AUTOMATICA 2008»
15 years 6 months ago
Invertibility of switched linear systems
Abstract-- We address a new problem--the invertibility problem for continuous-time switched linear systems, which is the problem of recovering the switching signal and the input un...
Linh Vu, Daniel Liberzon
JAL
2006
89views more  JAL 2006»
15 years 6 months ago
Improved bounds for the unsplittable flow problem
In this paper we consider the unsplittable flow problem (UFP): given a directed or undirected network G = (V, E) with edge capacities and a set of terminal pairs (or requests) wit...
Petr Kolman, Christian Scheideler