Sciweavers

989 search results - page 44 / 198
» Version spaces and the consistency problem
Sort
View
SODA
2000
ACM
120views Algorithms» more  SODA 2000»
13 years 10 months ago
Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks
This paper shows that the minimum ratio canceling algorithm of Wallacher (1989) (and a faster relaxed version) can be generalized to an algorithm for general linear programs with ...
S. Thomas McCormick, Akiyoshi Shioura
DAC
2010
ACM
13 years 9 months ago
A correlation-based design space exploration methodology for multi-processor systems-on-chip
Given the increasing complexity of multi-processor systems-onchip, a wide range of parameters must be tuned to find the best trade-offs in terms of the selected system figures of ...
Giovanni Mariani, Aleksandar Brankovic, Gianluca P...
JMLR
2006
148views more  JMLR 2006»
13 years 9 months ago
Computational and Theoretical Analysis of Null Space and Orthogonal Linear Discriminant Analysis
Dimensionality reduction is an important pre-processing step in many applications. Linear discriminant analysis (LDA) is a classical statistical approach for supervised dimensiona...
Jieping Ye, Tao Xiong
EAAI
2010
119views more  EAAI 2010»
13 years 7 months ago
A heuristic-based framework to solve a complex aircraft sizing problem
Aircraft sizing studies consist in determining the main characteristics of an aircraft starting from a set of requirements. These studies can be summarized as global constrained o...
Céline Badufle, Christophe Blondel, Thierry...
EELC
2006
121views Languages» more  EELC 2006»
14 years 21 days ago
Symbol Grounding Through Cumulative Learning
Abstract. We suggest that the primary motivation for an agent to construct a symbol-meaning mapping is to solve a task. The meaning space of an agent should be derived from the tas...
Samarth Swarup, Kiran Lakkaraju, Sylvian R. Ray, L...