Sciweavers

1511 search results - page 289 / 303
» Hierarchical Graph Transformation
Sort
View
GECCO
2003
Springer
15 years 2 months ago
A Kernighan-Lin Local Improvement Heuristic That Solves Some Hard Problems in Genetic Algorithms
We present a Kernighan-Lin style local improvement heuristic for genetic algorithms. We analyze the run-time cost of the heuristic. We demonstrate through experiments that the heur...
William A. Greene
HYBRID
1998
Springer
15 years 1 months ago
Formal Verification of Safety-Critical Hybrid Systems
This paper investigates how formal techniques can be used for the analysis and verification of hybrid systems [1,5,7,16] -- systems involving both discrete and continuous behavior....
Carolos Livadas, Nancy A. Lynch
AAAI
2006
14 years 11 months ago
Computing Slater Rankings Using Similarities among Candidates
Voting (or rank aggregation) is a general method for aggregating the preferences of multiple agents. One important voting rule is the Slater rule. It selects a ranking of the alte...
Vincent Conitzer
DAGSTUHL
2006
14 years 11 months ago
Hierarchies Relating Topology and Geometry
Cognitive Vision has to represent, reason and learn about objects in its environment it has to manipulate and react to. There are deformable objects like humans which cannot be des...
Walter G. Kropatsch, Yll Haxhimusa, Pascal Lienhar...
101
Voted
SODA
2003
ACM
133views Algorithms» more  SODA 2003»
14 years 11 months ago
Integrality ratio for group Steiner trees and directed steiner trees
The natural relaxation for the Group Steiner Tree problem, as well as for its generalization, the Directed Steiner Tree problem, is a flow-based linear programming relaxation. We...
Eran Halperin, Guy Kortsarz, Robert Krauthgamer, A...