Sciweavers

388 search results - page 54 / 78
» Discrete Hamilton-Jacobi theory and discrete optimal control
Sort
View
ECCV
2002
Springer
14 years 10 months ago
Real-Time Interactive Path Extraction with on-the-Fly Adaptation of the External Forces
The aim of this work is to propose an adaptation of optimal path based interactive tools for image segmentation (related to Live-Wire [12] and Intelligent Scissors [18] approaches)...
Olivier Gérard, Thomas Deschamps, Myriam Gr...
HYBRID
2009
Springer
14 years 3 months ago
Decompositional Construction of Lyapunov Functions for Hybrid Systems
In this paper, we present an automatable decompositional method for the computation of Lyapunov functions for hybrid systems with complex discrete state spaces. We use graph-based ...
Jens Oehlerking, Oliver E. Theel
GECCO
2006
Springer
161views Optimization» more  GECCO 2006»
14 years 9 days ago
Instance similarity and the effectiveness of case injection in a genetic algorithm for binary quadratic programming
When an evolutionary algorithm addresses a sequence of instances of the same problem, it can seed its population with solutions that it found for previous instances. This techniqu...
Jason Amunrud, Bryant A. Julstrom
GECCO
2006
Springer
157views Optimization» more  GECCO 2006»
14 years 9 days ago
How randomized search heuristics find maximum cliques in planar graphs
Surprisingly, general search heuristics often solve combinatorial problems quite sufficiently, although they do not outperform specialized algorithms. Here, the behavior of simple...
Tobias Storch
IPSN
2004
Springer
14 years 2 months ago
Lattice sensor networks: capacity limits, optimal routing and robustness to failures
We study network capacity limits and optimal routing algorithms for regular sensor networks, namely, square and torus grid sensor networks, in both, the static case (no node failu...
Guillermo Barrenechea, Baltasar Beferull-Lozano, M...