2107 search results - page 371 / 422 » Computing Small Search Numbers in Linear Time |
ISAAC
2005
Springer
14 years 2 months ago
2005
Springer
Consider an information network with harmful procedures called attackers (e.g., viruses); each attacker uses a probability distribution to choose a node of the network to damage. O...
ICRA
2002
IEEE
14 years 1 months ago
2002
IEEE
:This paper presents a trajectory planning algorithm for mobile robots which may be subject to kinodynamic constraints. Using computational methods from noncommutative harmonic ana...
CLUSTER
2004
IEEE
14 years 20 days ago
2004
IEEE
As high performance clusters continue to grow in size, the mean time between failure shrinks. Thus, the issues of fault tolerance and reliability are becoming one of the challengi...
COCO
2004
Springer
14 years 20 days ago
2004
Springer
Based on the framework of parameterized complexity theory, we derive tight lower bounds on the computational complexity for a number of well-known NP-hard problems. We start by pr...
ECAI
2010
Springer
13 years 9 months ago
2010
Springer
In service-oriented systems, such as grids and clouds, users are able to outsource complex computational tasks by procuring resources on demand from remote service providers. As th...