531 search results - page 57 / 107 » A Better Algorithm for Random k-SAT |
ATAL
2009
Springer
14 years 2 months ago
2009
Springer
Self-organising multi-agent systems provide a suitable paradigm for developing autonomic computing systems that manage themselves. Towards this goal, we demonstrate a robust, dece...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
The unsplittable flow problem is one of the most extensively studied optimization problems in the field of networking. An instance of it consists of an edge capacitated graph and ...
HIPEAC
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. Stream programming is a promising way to expose concurrency to the compiler. A stream program is built from kernels that communicate only via point-to-point streams. The ...
PIMRC
2010
IEEE
13 years 5 months ago
2010
IEEE
In this paper, a new type of collaboration in wireless sensor networks (WSN) is suggested that exploits array processing algorithms for better reception of a signal. For receive co...
CVPR
2011
IEEE
13 years 3 months ago
2011
IEEE
Recent work in structure from motion (SfM) has successfully built 3D models from large unstructured collections of images downloaded from the Internet. Most approaches use increme...