Sciweavers

327 search results - page 20 / 66
» Some Elimination Problems for Matrices
Sort
View
ASC
2004
13 years 9 months ago
Evaluation of services using a fuzzy analytic hierarchy process
This paper proposes a new approach for tackling the uncertainty and imprecision of the service evaluation process. Identifying suitable service offers, evaluating the offers and c...
Ludmil Mikhailov, Petco E. Tsvetinov
ICCAD
2003
IEEE
161views Hardware» more  ICCAD 2003»
14 years 6 months ago
A General S-Domain Hierarchical Network Reduction Algorithm
This paper presents an efficient method to reduce complexities of a linear network in s-domain. The new method works on circuit matrices directly and reduces the circuit complexi...
Sheldon X.-D. Tan
AEI
1999
120views more  AEI 1999»
13 years 9 months ago
Genetic algorithms for designing multihop lightwave network topologies
Multihop lightwave networks are a means of utilizing the large bandwidth of optical fibers. In these networks, each node has a fixed number of transmitters and receivers connected...
Cenk Gazen, Cem Ersoy
COMBINATORICS
2007
72views more  COMBINATORICS 2007»
13 years 9 months ago
Matrix Partitions with Finitely Many Obstructions
Each m by m symmetric matrix M over 0, 1, ∗, defines a partition problem, in which an input graph G is to be partitioned into m parts with adjacencies governed by M, in the sen...
Tomás Feder, Pavol Hell, Wing Xie
CORR
2010
Springer
75views Education» more  CORR 2010»
13 years 8 months ago
Dense Error-Correcting Codes in the Lee Metric
Several new applications and a number of new mathematical techniques have increased the research on errorcorrecting codes in the Lee metric in the last decade. In this work we cons...
Tuvi Etzion, Alexander Vardy, Eitan Yaakobi