Sciweavers

1302 search results - page 101 / 261
» Fair Equivalence Relations
Sort
View
DM
1998
95views more  DM 1998»
13 years 10 months ago
An Euler-type formula for median graphs
Let G be a median graph on n vertices and m edges and let k be the number of equivalence classes of the Djokovi´c’s relation Θ defined on the edge-set of G. Then 2n − m −...
Sandi Klavzar, Henry Martyn Mulder, Riste Skrekovs...
CORR
2010
Springer
159views Education» more  CORR 2010»
13 years 7 months ago
On optimizing over lift-and-project closures
The lift-and-project closure is the relaxation obtained by computing all lift-and-project cuts from the initial formulation of a mixed integer linear program or equivalently by co...
Pierre Bonami
ICFP
2004
ACM
14 years 10 months ago
Multi-return function call
It is possible to extend the basic notion of "function call" to allow functions to have multiple return points. This turns out to be a surprisingly useful mechanism. Thi...
Olin Shivers, David Fisher
EUROGP
2005
Springer
114views Optimization» more  EUROGP 2005»
14 years 3 months ago
Repeated Patterns in Tree Genetic Programming
We extend our analysis of repetitive patterns found in genetic programming genomes to tree based GP. As in linear GP, repetitive patterns are present in large numbers. Size fair cr...
William B. Langdon, Wolfgang Banzhaf
ICCS
2005
Springer
14 years 3 months ago
Conzilla - A Conceptual Interface to the Semantic Web
Abstract. This paper has two foci that are intended to be complementary. First, it describes Conzilla as an incarnation of a concept browser. More specifically, as a technical sol...
Matthias Palmér, Ambjörn Naeve