Sciweavers

1568 search results - page 57 / 314
» The problem of examination questions in algorithmics
Sort
View
CP
2000
Springer
15 years 2 months ago
Analysis of Random Noise and Random Walk Algorithms
Random Noise and Random Walk algorithms are local search strategies that have been used for the problem of satisfiability testing (SAT). We present a Markov-chain based analysis o...
Bhaskar Krishnamachari, Xi Xie, Bart Selman, Steph...
IJCAI
1989
14 years 11 months ago
Approximation Algorithms for Temporal Reasoning
We consider a representation for temporal relations between intervals introduced by James Allen, and its associated computational or reasoning problem: given possibly indefinite ...
Peter van Beek
GECCO
2003
Springer
118views Optimization» more  GECCO 2003»
15 years 3 months ago
Distributed Probabilistic Model-Building Genetic Algorithm
In this paper, a new model of Probabilistic Model-Building Genetic Algorithms (PMBGAs), Distributed PMBGA (DPMBGA), is proposed. In the DPMBGA, the correlation among the design var...
Tomoyuki Hiroyasu, Mitsunori Miki, Masaki Sano, Hi...
CORR
2008
Springer
99views Education» more  CORR 2008»
14 years 10 months ago
Partnering Strategies for Fitness Evaluation in a Pyramidal Evolutionary Algorithm
This paper combines the idea of a hierarchical distributed genetic algorithm with different interagent partnering strategies. Cascading clusters of sub-populations are built from ...
Uwe Aickelin, Larry Bull
94
Voted
STACS
2009
Springer
15 years 5 months ago
A Unified Algorithm for Accelerating Edit-Distance Computation via Text-Compression
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic-programming s...
Danny Hermelin, Gad M. Landau, Shir Landau, Oren W...