1381 search results - page 245 / 277 » Computational Complexity of Constraint Satisfaction |
TCS
2008
13 years 7 months ago
2008
We introduce a new problem that was motivated by a (more complicated) problem arising in a robotized assembly environment. The bin coloring problem is to pack unit size colored it...
DCG
1998
13 years 7 months ago
1998
We present a simple and e cient paradigm for computing the exact solution of the motionplanning problem in environments with a low obstacle density. Such environments frequently o...
JMLR
2002
13 years 7 months ago
2002
We present some greedy learning algorithms for building sparse nonlinear regression and classification models from observational data using Mercer kernels. Our objective is to dev...
IJHCI
2010
13 years 6 months ago
2010
Motivation – Designers make decisions that later influence how users work with the systems that they have designed. When errors occur in use, it is tempting to focus on the acti...
INFOCOM
2010
IEEE
13 years 6 months ago
2010
IEEE
—Opportunistic routing significantly increases unicast throughput in wireless mesh networks by effectively utilizing the wireless broadcast medium. With network coding, opportun...