Sciweavers

13987 search results - page 307 / 2798
» The Two Guards Problem
Sort
View
IJCAI
2003
15 years 8 months ago
Comparing Best-First Search and Dynamic Programming for Optimal Multiple Sequence Alignment
Sequence alignment is an important problem in computational biology. We compare two different approaches to the problem of optimally aligning two or more character strings: bounde...
Heath Hohwald, Ignacio Thayer, Richard E. Korf
MP
2008
117views more  MP 2008»
15 years 6 months ago
Stochastic programming approach to optimization under uncertainty
In this paper we discuss computational complexity and risk averse approaches to two and multistage stochastic programming problems. We argue that two stage (say linear) stochastic ...
Alexander Shapiro
PAMI
2006
128views more  PAMI 2006»
15 years 6 months ago
Multisurface Proximal Support Vector Machine Classification via Generalized Eigenvalues
A new approach to support vector machine (SVM) classification is proposed wherein each of two data sets are proximal to one of two distinct planes that are not parallel to each oth...
Olvi L. Mangasarian, Edward W. Wild
EC
2008
153views ECommerce» more  EC 2008»
15 years 6 months ago
On Complexity of Optimal Recombination for Binary Representations of Solutions
We consider an optimization problem of finding the best possible offspring as a result of a recombination operator in an evolutionary algorithm, given two parent solutions. The op...
Anton V. Eremeev
FSTTCS
2005
Springer
16 years 7 days ago
Comparing Trees Via Crossing Minimization
Abstract. Two trees with the same number of leaves have to be embedded in two layers in the plane such that the leaves are aligned in two adjacent layers. Additional matching edges...
Henning Fernau, Michael Kaufmann, Mathias Poths