Sciweavers

8141 search results - page 119 / 1629
» Higher Order Generalization
Sort
View
128
Voted
CAV
2010
Springer
190views Hardware» more  CAV 2010»
15 years 6 months ago
Measuring and Synthesizing Systems in Probabilistic Environments
Often one has a preference order among the different systems that satisfy a given specification. Under a probabilistic assumption about the possible inputs, such a preference order...
Krishnendu Chatterjee, Thomas A. Henzinger, Barbar...
139
Voted
AMC
2007
125views more  AMC 2007»
15 years 3 months ago
Geometric multigrid for high-order regularizations of early vision problems
The surface estimation problem is used as a model to demonstrate a framework for solving early vision problems by high-order regularization with natural boundary conditions. Becaus...
Stephen L. Keeling, Gundolf Haase
101
Voted
GECCO
2007
Springer
175views Optimization» more  GECCO 2007»
15 years 9 months ago
On the constructiveness of context-aware crossover
Crossover in Genetic Programming is mostly a destructive operator, generally producing children worse than the parents and occasionally producing those who are better. A recently ...
Hammad Majeed, Conor Ryan
ENDM
2006
57views more  ENDM 2006»
15 years 3 months ago
One-point extensions of generalized hexagons and octagons
In this note, we prove the uniqueness of the one-point extension S of a generalized hexagon of order 2 and prove the non-existence of such an extension S of any other finite gener...
Hans Cuypers, A. De Wispelaere, Hendrik Van Maldeg...
131
Voted
DAM
2011
14 years 10 months ago
A General Label Search to investigate classical graph search algorithms
Many graph search algorithms use a labeling of the vertices to compute an ordering of the vertices. We generalize this idea by devising a general vertex labeling algorithmic proce...
Richard Krueger, Geneviève Simonet, Anne Be...