957 search results - page 39 / 192 » Addition Chain Heuristics |
AIPS
2010
15 years 2 months ago
2010
Anytime search algorithms solve optimisation problems by quickly finding a usually suboptimal solution and then finding improved solutions when given additional time. To deliver a...
111
click to vote
HEURISTICS
2002
14 years 11 months ago
2002
In the paper, a new hybrid genetic algorithm solving the DNA sequencing problem with negative and positive errors is presented. The algorithm has as its input a set of oligonucleo...
AI
2007
Springer
15 years 6 months ago
2007
Springer
When using Bayesian networks, practitioners often express constraints among variables by conditioning a common child node to induce the desired distribution. For example, an ‘orâ...
EUSFLAT
2009
14 years 9 months ago
2009
Abstract-- Planning resources for a supply chain is a major factor determining its success or failure. In this paper we introduce an Interval Type-2 Fuzzy Logic model of a distribu...
HM
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. We discuss a general approach to hybridize traditional construction heuristics for combinatorial optimization problems with numerical based evolutionary algorithms. There...