3356 search results - page 267 / 672 » Computing education for sustainability |
145
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
We prove that the max-cut and max-bisection problems are NP-hard on unit disk graphs. We also show that -precision graphs are planar for > 1/ 2 and give a dichotomy theorem f...
157
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
Abstract: We introduce the snowblower problem (SBP), a new optimization problem that is closely related to milling problems and to some material-handling problems. The objective in...
167
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
-- We introduce a thermodynamic (large deviation) formalism for computing error exponents in error-correcting codes. Within this framework, we apply the heuristic cavity method fro...
161
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
Abstract - This short paper introduces two new fusion rules for combining quantitative basic belief assignments. These rules although very simple have not been proposed in literatu...
168
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. The simplex method in Linear Programming motivates several problems of asymptotic convex geometry. We discuss some conjectures and known results in two related directions...