9842 search results - page 62 / 1969 » Problem complexity |
CIAC
2006
Springer
14 years 1 months ago
2006
Springer
Let 1 and 0 be real numbers. A tree T = (V, E ) is a distance (, )
WDAG
2010
Springer
13 years 8 months ago
2010
Springer
Leader election and arbitrary pattern formation are fundammental tasks for a set of autonomous mobile robots. The former consists in distinguishing a unique robot, called the lead...
ISCAS
2002
IEEE
14 years 2 months ago
2002
IEEE
The problem of a useful electrical power quantification in environments with power quality problems is discussed. As it is difficult to correctly apply a Fourier-based approach, a...
DLT
2007
13 years 11 months ago
2007
Abstract. Inapproximability results concerning minimization of nondeterministic finite automata relative to given deterministic finite automata were obtained only recently, modul...
GECCO
2009
Springer
14 years 2 months ago
2009
Springer
Evolutionary problem decomposition techniques divide a complex problem into simpler subproblems, evolve individuals to produce subcomponents that solve the subproblems, and then a...