383 search results - page 21 / 77 » A new infeasible interior-point algorithm for linear program... |
130
Voted
CPAIOR
2009
Springer
15 years 10 months ago
2009
Springer
Many real-world problems require the enumeration of all solutions of combinatorial search problems, even though this is often infeasible in practice. However, not always all parts ...
172
Voted
ATAL
2008
Springer
15 years 5 months ago
2008
Springer
In a class of games known as Stackelberg games, one agent (the leader) must commit to a strategy that can be observed by the other agent (the follower or adversary) before the adv...
133
click to vote
TASE
2008
IEEE
15 years 3 months ago
2008
IEEE
This paper addresses the general single-machine earliness-tardiness problem with distinct release dates, due dates, and unit costs. The aim of this research is to obtain an exact n...
179
Voted
BMCBI
2002
15 years 3 months ago
2002
Background: Covariance models (CMs) are probabilistic models of RNA secondary structure, analogous to profile hidden Markov models of linear sequence. The dynamic programming algo...
151
Voted
APPT
2007
Springer
15 years 5 months ago
2007
Springer
Dynamic programming is a widely applied algorithm design technique in many areas such as computational biology and scientific computing. Typical applications using this technique a...