8496 search results - page 268 / 1700 » Problem Solving and Complex Systems |
214
click to vote
STACS
2005
Springer
16 years 17 days ago
2005
Springer
Exponential algorithms, i.e. algorithms of complexity O(cn ) for some c > 1, seem to be unavoidable in the case of NP-complete problems (unless P=NP), especially if the problem ...
204
click to vote
IESS
2007
Springer
16 years 1 months ago
2007
Springer
This work investigates the use of reconfigurable devices as computing platform for self-organizing embedded systems. Those usually consist of a set of distributed, autonomous node...
248
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
In this paper we consider the application of a homotopy-continuation based method for finding interference alignment (IA) solutions for the deterministic K-user multiple-input mu...
203
click to vote
GLOBECOM
2009
IEEE
16 years 1 months ago
2009
IEEE
— The dynamic composition of systems of networked appliances, or virtual devices, enables users to generate complex strong specific systems. Current prominent MANET-based composi...
163
click to vote
ICRA
2005
IEEE
16 years 21 days ago
2005
IEEE
— The last decade, sampling based planners like the Probabilistic Roadmap Method have proved to be successful in solving complex motion planning problems. We give a reachability ...