14386 search results - page 235 / 2878 » The Chinese Generals Problem |
130
Voted
COR
2010
15 years 4 months ago
2010
The problem addressed in this paper is the decision problem of determining if a set of multi-dimensional rectangular boxes can be orthogonally packed into a rectangular bin while ...
135
click to vote
TIT
2008
15 years 4 months ago
2008
We determine the rate region of the quadratic Gaussian two-encoder source-coding problem. This rate region is achieved by a simple architecture that separates the analog and digita...
141
click to vote
JDA
2010
14 years 11 months ago
2010
We present subexponential parameterized algorithms on planar graphs for a family of problems of the following shape: given a graph, find a connected (induced) subgraph with bounde...
138
click to vote
STOC
2006
ACM
15 years 10 months ago
2006
ACM
We show that for any constant ε > 0, there is no Ω(log1−ε M)approximation algorithm for the directed congestion minimization problem on networks of size M unless NP ⊆ Z...
124
click to vote
EVOW
2005
Springer
15 years 10 months ago
2005
Springer
We show how an evolutionary algorithm can successfully be used to evolve a set of difficult to solve symmetric travelling salesman problem instances for two variants of the Lin-Ker...