3934 search results - page 311 / 787 » Approximate Schedulability Analysis |
169
click to vote
CP
2006
Springer
15 years 10 months ago
2006
Springer
Many important combinatorial optimization problems can be expressed as constraint satisfaction problems with soft constraints. When problems are too difficult to be solved exactly,...
168
click to vote
POPL
1999
ACM
15 years 11 months ago
1999
ACM
This paper presents a program analysis to estimate uncaught exceptions in ML programs. This analysis relies on unification-based type inference in a non-standard type system, usi...
214
click to vote
ICC
2007
IEEE
16 years 1 months ago
2007
IEEE
This paper presents an analytical approach to evaluate the expected complexity of a generalized sphere decoding (GSD) algorithm, GSDλ − , for underdetermined integer leastsquare...
193
click to vote
SLSFS
2005
Springer
16 years 4 days ago
2005
Springer
Abstract. This article presents a unified theory for analysis of components in discrete data, and compares the methods with techniques such as independent component analysis, non-...
165
click to vote
ESANN
2006
15 years 8 months ago
2006
Abstract. We present a new method for analyzing classifiers by visualization, which we call visual nonlinear discriminant analysis. Classifiers that output posterior probabilities ...