4781 search results - page 174 / 957 » Complexity at large |
52
Voted
ISCAS
2007
IEEE
15 years 7 months ago
2007
IEEE
— Sphere decoding enables maximum likelihood (ML) detection with lower complexity than other decoding algorithms, but it still suffers from large computational delay. This paper ...
134
Voted
WLP
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. The maintenance of large knowledge systems usually is a rather complex task. In this paper we will show that extensions or modifications of a knowledge base can be suppo...
96
Voted
EURODAC
1994
IEEE
1994
IEEE
OSCAR: optimum simultaneous scheduling, allocation and resource binding based on integer programming
15 years 4 months ago
: This paper presents an approach to high-level synthesis which is based upon a 0/1 integer programming model. In contrast to other approaches, this model allows solving all three ...
76
Voted
UAI
1997
15 years 2 months ago
1997
It has been shown that a class of probabilistic domain models cannot be learned correctly by several existing algorithms which employ a single-link lookahead search. When a multil...
102
Voted
ICSEA
2008
IEEE
15 years 7 months ago
2008
IEEE
Despite progress in model engineering, modeling large distributed systems is still a long and complex task. This paper outlines a methodology based on UML to make the modeling of ...