2244 search results - page 57 / 449 » A new heuristic approach for non-convex optimization problem... |
184
click to vote
CP
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. Selecting conformations for side-chains is an important subtask in building three-dimensional protein models. Side-chain placement is a difficult problem because of the l...
188
click to vote
EC
2008
15 years 6 months ago
2008
The development of successful metaheuristic algorithms such as local search for a difficult problems such as satisfiability testing (SAT) is a challenging task. We investigate an ...
147
click to vote
ICCAD
2001
IEEE
16 years 3 months ago
2001
IEEE
We present a two-level Boolean minimization tool (BOOM) based on a new implicant generation paradigm. In contrast to all previous minimization methods, where the implicants are ge...
145
click to vote
STOC
2003
ACM
16 years 6 months ago
2003
ACM
We study novel combinatorial properties of graphs that allow us to devise a completely new approach to dynamic all pairs shortest paths problems. Our approach yields a fully dynam...
170
click to vote
BMCBI
2005
15 years 6 months ago
2005
Background: Exhaustive methods of sequence alignment are accurate but slow, whereas heuristic approaches run quickly, but their complexity makes them more difficult to implement. ...