Sciweavers

9842 search results - page 418 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
COLT
2005
Springer
15 years 10 months ago
Rank, Trace-Norm and Max-Norm
We study the rank, trace-norm and max-norm as complexity measures of matrices, focusing on the problem of fitting a matrix with matrices having low complexity. We present generali...
Nathan Srebro, Adi Shraibman
ICTAI
1997
IEEE
15 years 8 months ago
GA-Based Performance Analysis of Network Protocols
This paper tackles the problem of analyzing the correctness and performance of a computer network protocol. Given the complexity of the problem, no currently used technique is abl...
Mario Baldi, Fulvio Corno, Maurizio Rebaudengo, Gi...
145
Voted
DESRIST
2009
Springer
115views Education» more  DESRIST 2009»
15 years 8 months ago
Ontological design
In this paper, we describe the concept of ontological design. We show how ontologies can be used as cognitive maps of complex, ill-structured, plastic problems. They can be used t...
Arkalgud Ramaprasad, Sridhar S. Papagari
131
Voted
WSC
2007
15 years 7 months ago
IFAO-SIMO: a spatial-simulation based facility network optimization framework
This paper describes an innovative framework, iFAOSimo, which integrates optimization, simulation and GIS (geographic information system) techniques to handle complex spatial faci...
Ming Xie, Wei Wang, Wen Jun Yin, Jin Dong
151
Voted
IJCAI
1989
15 years 5 months ago
Training Feedforward Neural Networks Using Genetic Algorithms
Multilayered feedforward neural networks possess a number of properties which make them particularly suited to complex pattern classification problems. However, their application ...
David J. Montana, Lawrence Davis