4432 search results - page 184 / 887 » Solving Demodulation as an Optimization Problem |
125
Voted
GECCO
2008
Springer
15 years 4 months ago
2008
Springer
We study the minimum s-t-cut problem in graphs with costs on the edges in the context of evolutionary algorithms. Minimum cut problems belong to the class of basic network optimiz...
123
click to vote
AAAI
1998
15 years 4 months ago
1998
Weexaminethree heuristic algorithms for gameswith imperfect information: Monte-carlo sampling, and two newalgorithms wecall vector minimaxingand payoffreduction minimaxing. Wecomp...
132
click to vote
AIIA
2009
Springer
15 years 8 months ago
2009
Springer
In this paper a planning framework based on Ant Colony Optimization techniques is presented. Optimal planning is a very hard computational problem which has been coped with differe...
120
click to vote
GECCO
2008
Springer
15 years 4 months ago
2008
Springer
Hill-climbing has been shown to be more effective than exhaustive search in solving satisfiability problems.Also, it has been used either by itself or in combination with other ...
113
Voted
PROCEDIA
2010
15 years 1 months ago
2010
When solving machine learning problems, there is currently little automated support for easily experimenting with alternative statistical models or solution strategies. This is be...