6562 search results - page 103 / 1313 » Noetherianity and Combination Problems |
140
click to vote
TC
2008
15 years 5 months ago
2008
In this paper, the problem of finding good wordlength combinations for fixed-point digital signal processing flowgraphs is addressed. By formulating and solving an approximate opti...
123
click to vote
ATAL
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. The agent design problem is as follows: Given an environment, together with a specification of a task, is it possible to construct an agent that will guarantee to succes...
164
click to vote
GECCO
2009
Springer
15 years 10 months ago
2009
Springer
High–dimensional optimization problems appear very often in demanding applications. Although evolutionary algorithms constitute a valuable tool for solving such problems, their ...
182
click to vote
SAGA
2007
Springer
16 years 1 days ago
2007
Springer
Abstract. Motivated by an application in project portfolio analysis under uncertainty, we develop an algorithm S-VNS for solving stochastic combinatorial optimization (SCO) problem...
132
click to vote
CP
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. The Quasigroup Completion Problem (QCP) is a very challenging benchmark among combinatorial problems, and the focus of much recent interest in the area of constraint prog...