Sciweavers

113 search results - page 9 / 23
» Combinatorial Flag Varieties
Sort
View
124
Voted
JSC
2000
99views more  JSC 2000»
15 years 3 months ago
Computing Orbits of Minimal Parabolic k-subgroups Acting on Symmetric k-varieties
The orbits of a minimal parabolic k-subgroup acting on a symmetric k-variety are essential to the study of symmetric k-varieties and their representations. This paper gives an algo...
Aloysius G. Helminck
105
Voted
AICOM
2007
61views more  AICOM 2007»
15 years 3 months ago
Scheduling social tournaments locally
Abstract. Tournament scheduling, such as the social golfer problem, has attracted significant attention in recent years because of their highly symmetrical and combinatorial natur...
Iván Dotú, Pascal Van Hentenryck
130
Voted
ESA
2007
Springer
176views Algorithms» more  ESA 2007»
15 years 9 months ago
Arrangements in Geometry: Recent Advances and Challenges
We review recent progress in the study of arrangements in computational and combinatorial geometry, and discuss several open problems and areas for further research. In this talk I...
Micha Sharir
126
Voted
GECCO
2004
Springer
125views Optimization» more  GECCO 2004»
15 years 9 months ago
Population-Based Iterated Local Search: Restricting Neighborhood Search by Crossover
Abstract. Iterated local search (ILS) is a powerful meta-heuristic algorithm applied to a large variety of combinatorial optimization problems. Contrary to evolutionary algorithms ...
Dirk Thierens
113
Voted
JAL
1998
85views more  JAL 1998»
15 years 3 months ago
Isomorph-Free Exhaustive Generation
We describe a very general technique for generating families of combinatorial objects without isomorphs. It applies to almost any class of objects for which an inductive construct...
Brendan D. McKay