Sciweavers

17760 search results - page 240 / 3552
» A Generalization of the Massey-Ding Algorithm
Sort
View
GECCO
2006
Springer
166views Optimization» more  GECCO 2006»
15 years 8 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
CAIP
1995
Springer
155views Image Analysis» more  CAIP 1995»
15 years 8 months ago
A Proposal for the Implementation of a Parallel Watershed Algorithm
In this paper a parallel implementation of a watershed algorithm is proposed. The algorithm is designed for a ring-architecture with distributed memory and a piece of shared memory...
Arnold Meijster, Jos B. T. M. Roerdink
133
Voted
CIAC
2010
Springer
232views Algorithms» more  CIAC 2010»
15 years 8 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
111
Voted
FLAIRS
2008
15 years 7 months ago
CANDEL: An Algorithm for Same-Sentence Pronominal Resolution
This paper presents a syntactic path-based learning algorithm (CANDEL from CANDIDATE-ELIMINATION) for the coreference resolution of pronouns that have their antecedents in the sam...
Cristina Nicolae, Gabriel Nicolae
COLT
2008
Springer
15 years 6 months ago
Competing in the Dark: An Efficient Algorithm for Bandit Linear Optimization
We introduce an efficient algorithm for the problem of online linear optimization in the bandit setting which achieves the optimal O ( T) regret. The setting is a natural general...
Jacob Abernethy, Elad Hazan, Alexander Rakhlin