Sciweavers

4302 search results - page 174 / 861
» Index Pairs Algorithms
Sort
View
GECCO
2006
Springer
166views Optimization» more  GECCO 2006»
14 years 2 months ago
Solving identification problem for asynchronous finite state machines using genetic algorithms
A Genetic Algorithm, embedded in a simulation-based method, is applied to the identification of Asynchronous Finite State Machines. Two different coding schemes and their associat...
Xiaojun Geng
CIAC
2010
Springer
232views Algorithms» more  CIAC 2010»
14 years 2 months ago
Multicut Algorithms via Tree Decompositions
Various forms of multicut problems are of great importance in the area of network design. In general, these problems are intractable. However, several parameters have been identifi...
Reinhard Pichler, Stefan Rümmele, Stefan Woltran
ICIP
2005
IEEE
15 years 9 days ago
The multiRANSAC algorithm and its application to detect planar homographies
A RANSAC based procedure is described for detecting inliers corresponding to multiple models in a given set of data points. The algorithm we present in this paper (called multiRAN...
Marco Zuliani, Charles S. Kenney, B. S. Manjunath
IWPEC
2009
Springer
14 years 5 months ago
Improved Parameterized Algorithms for the Kemeny Aggregation Problem
We give improvements over fixed parameter tractable (FPT) algorithms to solve the Kemeny aggregation problem, where the task is to summarize a multi-set of preference lists, call...
Narges Simjour
CPAIOR
2008
Springer
14 years 13 days ago
Using Local Search to Speed Up Filtering Algorithms for Some NP-Hard Constraints
Abstract. This paper proposes to use local search inside filtering algorithms of combinatorial structures for which achieving a desired level of consistency is too computationally ...
Philippe Galinier, Alain Hertz, Sandrine Paroz, Gi...