7065 search results - page 1013 / 1413 » Iterative Scheduling Algorithms |
188
click to vote
ATVA
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. The bounded synthesis problem is to construct an implementation that satisfies a given temporal specification and a given bound on the number of states. We present a so...
150
click to vote
CLEF
2007
Springer
16 years 1 months ago
2007
Springer
This paper presents a revised version of an unsupervised and knowledge-free morpheme boundary detection algorithm based on letter successor variety (LSV) and a trie classifier [5...
164
click to vote
COCO
2007
Springer
16 years 1 months ago
2007
Springer
We study the link between the complexity of a polynomial and that of its coefficient functions. Valiant’s theory is a good setting for this, and we start by generalizing one of V...
175
click to vote
CSR
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. How could one estimate the total number of clicks a new advertisement could potentially receive in the current market? This question, called the click volume estimation p...
149
click to vote
GECCO
2007
Springer
16 years 1 months ago
2007
Springer
In a preliminary part of this paper, we analyze the necessity of randomness in evolution strategies. We conclude to the necessity of ”continuous”-randomness, but with a much m...