6142 search results - page 621 / 1229 » The Complexity of Partition Functions |
191
click to vote
EURODAC
1994
IEEE
1994
IEEE
OSCAR: optimum simultaneous scheduling, allocation and resource binding based on integer programming
15 years 11 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 ...
230
click to vote
COCO
1993
Springer
15 years 11 months ago
1993
Springer
We introduce a linear algebraic model of computation, the Span Program, and prove several upper and lower bounds on it. These results yield the following applications in complexit...
174
click to vote
GECCO
2007
Springer
15 years 11 months ago
2007
Springer
The learning in a niche based learning classifier system depends both on the complexity of the problem space and on the number of available actions. In this paper, we introduce a ...
123
click to vote
ICPR
2010
IEEE
15 years 9 months ago
2010
IEEE
We present a methodology for learning spline-based probabilistic models for sets of contours, proposing a new Monte Carlo variant of the EM algorithm to estimate the parameters of...
214
click to vote
CBSE
2008
Springer
15 years 9 months ago
2008
Springer
Component-based software engineering proposes building complex applications from COTS (Commercial Off-The-Shelf) organized into component markets. Therefore, the main development e...