952 search results - page 110 / 191 » Computational complexity of stochastic programming problems |
GECCO
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. This paper continues our systematic study of an RNAediting computational model of Genetic Algorithms (GA). This model is constructed based on several genetic editing char...
121
Voted
IEEEPACT
2000
IEEE
15 years 7 months ago
2000
IEEE
Region-based compilation repartitions a program into more desirable compilation units for optimization and scheduling, particularly beneficial for ILP architectures. With region-...
124
click to vote
GD
2006
Springer
15 years 6 months ago
2006
Springer
Graph drawing software are now commonly used. However, the choice of a well-adapted program may be hard for an inexperienced user. This poster presents a website (http://www.polyte...
111
Voted
WABI
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. In this paper, we use integer programming approach for solving a hard combinatorial optimization problem, namely protein threading. For this sequence-to-structure alignme...
132
click to vote
COMPGEOM
1998
ACM
15 years 7 months ago
1998
ACM
Abstract. We propose a simple, general, randomized technique to reduce certain geometric optimization problems to their corresponding decision problems. These reductions increase t...