Sciweavers

957 search results - page 39 / 192
» Addition Chain Heuristics
Sort
View
AIPS
2010
14 years 11 days ago
The Joy of Forgetting: Faster Anytime Search via Restarting
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...
Silvia Richter, Jordan Tyler Thayer, Wheeler Ruml
HEURISTICS
2002
146views more  HEURISTICS 2002»
13 years 9 months ago
Hybrid Genetic Algorithm for DNA Sequencing with Errors
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...
Jacek Blazewicz, Marta Kasprzak, Wojciech Kuroczyc...
AI
2007
Springer
14 years 4 months ago
Adding Local Constraints to Bayesian Networks
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â...
Mark Crowley, Brent Boerlage, David Poole
EUSFLAT
2009
212views Fuzzy Logic» more  EUSFLAT 2009»
13 years 7 months ago
An Interval Type-2 Fuzzy Distribution Network
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...
Simon Miller, Viara Popova, Robert John, Mario A. ...
HM
2007
Springer
114views Optimization» more  HM 2007»
14 years 1 months ago
Hybrid Numerical Optimization for Combinatorial Network Problems
Abstract. We discuss a general approach to hybridize traditional construction heuristics for combinatorial optimization problems with numerical based evolutionary algorithms. There...
Markus Chimani, Maria Kandyba, Mike Preuss