Sciweavers

8016 search results - page 1156 / 1604
» On the practical genetic algorithms
Sort
View
CAISE
2006
Springer
15 years 8 months ago
Incremental Workflow Mining for Process Flexibility
Abstract. Incremental workflow mining is a technique for automatically deriving a process model from the on-going executions of a process. This way, the process model becomes more ...
Ekkart Kindler, Vladimir Rubin, Wilhelm Schäf...
COMPGEOM
2008
ACM
15 years 8 months ago
Locally uniform anisotropic meshing
Anisotropic meshes are triangulations of a given domain in the plane or in higher dimensions, with elements elongated along prescribed directions. Anisotropic triangulations have ...
Jean-Daniel Boissonnat, Camille Wormser, Mariette ...
CP
2008
Springer
15 years 8 months ago
Classes of Submodular Constraints Expressible by Graph Cuts
Submodular constraints play an important role both in theory and practice of valued constraint satisfaction problems (VCSPs). It has previously been shown, using results from the ...
Stanislav Zivný, Peter Jeavons
CPM
2008
Springer
148views Combinatorics» more  CPM 2008»
15 years 8 months ago
On-Line Approximate String Matching with Bounded Errors
We introduce a new dimension to the widely studied on-line approximate string matching problem, by introducing an error threshold parameter so that the algorithm is allowed to mis...
Marcos A. Kiwi, Gonzalo Navarro, Claudio Telha
EUROGP
2007
Springer
171views Optimization» more  EUROGP 2007»
15 years 8 months ago
Geometric Particle Swarm Optimisation
Geometric particle swarm optimization (GPSO) is a recently introduced formal generalization of traditional particle swarm optimization (PSO) that applies naturally to both continu...
Alberto Moraglio, Cecilia Di Chio, Riccardo Poli
« Prev « First page 1156 / 1604 Last » Next »