4860 search results - page 480 / 972 » SNPs Problems, Complexity, and Algorithms |
156
click to vote
MAGS
2010
14 years 11 months ago
2010
Coordinating agents in a complex environment is a hard problem, but it can become even harder when certain characteristics of the tasks, like the required number of agents, are un...
114
click to vote
TSP
2010
14 years 10 months ago
2010
Abstract--This correspondence considers the problem of robust waveform design in the presence of colored Gaussian disturbance under a similarity and an energy constraint. We resort...
157
Voted
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
In the independent component analysis, polynomial functions of higher order statistics are often used as cost functions. However, such cost functions usually have many local minim...
123
click to vote
PRDC
2007
IEEE
15 years 10 months ago
2007
IEEE
Failure detector class Ωk has been defined in [18] as an extension to failure detector Ω, and an algorithm has been given in [16] to solve k-set agreement using Ωk in async...
126
click to vote
GD
2005
Springer
15 years 9 months ago
2005
Springer
Most graph layout algorithms treat nodes as points. The problem of node overlap removal is to adjust the layout generated by such methods so that nodes of non-zero width and height...