14386 search results - page 261 / 2878 » The Chinese Generals Problem |
157
click to vote
EVOW
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. We present the newly developed core concept for the Multidimensional Knapsack Problem (MKP) which is an extension of the classical concept for the one-dimensional case. T...
135
click to vote
ESEM
2008
ACM
15 years 6 months ago
2008
ACM
Some agile voices have been raised against extensive documentation. They advocate its sparse use and production. In this paper, we report from agile evolution and maintenance tren...
153
click to vote
SODA
2000
ACM
15 years 6 months ago
2000
ACM
Given a set P of points in the first quadrant, a Rectilinear Steiner Arborescence (RSA) is a directed tree rooted at the origin, containing all points in P, and composed solely of...
180
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
A general framework for solving image inverse problems is introduced in this paper. The approach is based on Gaussian mixture models, estimated via a computationally efficient MAP...
128
click to vote
DAM
2006
15 years 4 months ago
2006
The Satisfactory Partition problem consists in deciding if a given graph has a partition of its vertex set into two nonempty parts such that each vertex has at least as many neigh...