Sciweavers

11160 search results - page 209 / 2232
» Incompleteness in a General Setting
Sort
View
ICALP
2011
Springer
14 years 7 months ago
On Tree-Constrained Matchings and Generalizations
We consider the following Tree-Constrained Bipartite Matching problem: Given two rooted trees T1 = (V1, E1), T2 = (V2, E2) and a weight function w : V1 × V2 → R+, find a maximu...
Stefan Canzar, Khaled M. Elbassioni, Gunnar W. Kla...
TEC
2012
197views Formal Methods» more  TEC 2012»
13 years 6 months ago
Improving Generalization Performance in Co-Evolutionary Learning
Recently, the generalization framework in co-evolutionary learning has been theoretically formulated and demonstrated in the context of game-playing. Generalization performance of...
Siang Yew Chong, Peter Tino, Day Chyi Ku, Xin Yao
GIS
2006
ACM
16 years 5 months ago
Generalization of land cover maps by mixed integer programming
We present a novel method for the automatic generalization of land cover maps. A land cover map is composed of areas that collectively form a tessellation of the plane and each ar...
Jan-Henrik Haunert, Alexander Wolff
ICDM
2006
IEEE
166views Data Mining» more  ICDM 2006»
15 years 10 months ago
Mining Generalized Graph Patterns Based on User Examples
There has been a lot of recent interest in mining patterns from graphs. Often, the exact structure of the patterns of interest is not known. This happens, for example, when molecu...
Pavel Dmitriev, Carl Lagoze
COCOON
2008
Springer
15 years 6 months ago
Approximating the Generalized Capacitated Tree-Routing Problem
In this paper, we introduce the generalized capacitated tree-routing problem (GCTR), which is described as follows. Given a connected graph G = (V, E) with a sink s V and a set M...
Ehab Morsy, Hiroshi Nagamochi