14386 search results - page 409 / 2878 » The Chinese Generals Problem |
162
click to vote
DM
2008
15 years 7 months ago
2008
We consider the problems of finding the maximum number of vertex-disjoint triangles (VTP) and edge-disjoint triangles (ETP) in a simple graph. Both problems are NP-hard. The algor...
130
click to vote
NPL
2008
15 years 6 months ago
2008
In this paper, the problem of residual variance estimation is examined. The problem is analyzed in a general setting which covers non-additive heteroscedastic noise under non-iid s...
170
click to vote
GECCO
2007
Springer
16 years 1 months ago
2007
Springer
The work addresses the problem of identifying the epistatic linkage of a function from high cardinality alphabets to the real numbers. It is a generalization of Heckendorn and Wri...
153
click to vote
VLDB
2001
ACM
15 years 11 months ago
2001
ACM
In this paper we propose a new operator for advanced exploration of large multidimensional databases. The proposed operator can automatically generalize from a specific problem c...
169
click to vote
TOG
2008
15 years 6 months ago
2008
Modeling the large space of possible human motions requires scalable techniques. Generalizing from example motions or example controllers is one way to provide the required scalab...