11160 search results - page 226 / 2232 » Incompleteness in a General Setting |
152
click to vote
CCCG
2010
15 years 7 months ago
2010
By a polygonization of a finite point set S in the plane we understand a simple polygon having S as the set of its vertices. Let B and R be sets of blue and red points, respective...
150
click to vote
GECCO
2008
Springer
15 years 6 months ago
2008
Springer
An open problem in multiobjective optimization using the Pareto optimality criteria, is how to evaluate the performance of different evolutionary algorithms that solve multi– o...
119
click to vote
ARSCOM
2007
15 years 5 months ago
2007
For any h ∈ N, a graph G = (V, E) is said to be h-magic if there exists a labeling l : E(G) → Zh − {0} such that the induced vertex labeling l+ : V (G) → Zh defined by l+ ...
179
click to vote
JAIR
2006
15 years 5 months ago
2006
In this paper, we show that there is a close relation between consistency in a constraint network and set intersection. A proof schema is provided as a generic way to obtain consi...
158
click to vote
JCT
2006
15 years 5 months ago
2006
A k-majority tournament T on a finite vertex set V is defined by a set of 2k - 1 linear orderings of V, with u v if and only if u lies above v in at least k of the orders. Motiva...