796 search results - page 84 / 160 » Approximating the centroid is hard |
ICPP
1998
IEEE
13 years 12 months ago
1998
IEEE
This paper presents a new schedulability analysis methodology for distributed hard real-time systems with bursty job arrivals. The schedulability is analyzed by comparing worst-ca...
LION
2010
Springer
13 years 11 months ago
2010
Springer
MOEA/D is a multi-objective metaheuristic which has shown a remarkable performance when solving hard optimization problems. In this paper, we propose a thread-based parallel versio...
BIRTHDAY
2006
Springer
13 years 11 months ago
2006
Springer
Interpretation for Worst and Average Case Analysis Alessandra Di Pierro1 , Chris Hankin2 , and Herbert Wiklicky2 1 Dipartimento di Informatica, University of Pisa, Italy 2 Departme...
CDC
2009
IEEE
13 years 11 months ago
2009
IEEE
—In kernel based regression techniques (such as Support Vector Machines or Least Squares Support Vector Machines) it is hard to analyze the influence of perturbed inputs on the ...
AAAI
2007
13 years 10 months ago
2007
Developing scalable coordination algorithms for multi-agent systems is a hard computational challenge. One useful approach, demonstrated by the Coverage Set Algorithm (CSA), explo...