12825 search results - page 298 / 2565 » Improved PLSOM algorithm |
195
click to vote
GECCO
2007
Springer
16 years 1 months ago
2007
Springer
Recent research into single–objective continuous Estimation– of–Distribution Algorithms (EDAs) has shown that when maximum–likelihood estimations are used for parametric d...
213
click to vote
INFOCOM
2005
IEEE
16 years 24 days ago
2005
IEEE
— Multihoming is a popular method used by large enterprises and stub ISPs to connect to the Internet to reduce cost and improve performance. Recently researchers have studied the...
221
click to vote
SAC
2003
ACM
16 years 14 days ago
2003
ACM
Given a connected, weighted, undirected graph G and a bound D, the bounded-diameter minimum spanning tree problem seeks a spanning tree on G of lowest weight in which no path betw...
224
click to vote
TWC
2010
15 years 1 months ago
2010
Relay selection for cooperative communications promises significant performance improvements, and is, therefore, attracting, considerable attention. While several criteria have be...
158
click to vote
WG
2007
Springer
16 years 1 months ago
2007
Springer
NLC-width is a variant of clique-width with many application in graph algorithmic. This paper is devoted to graphs of NLC-width two. After giving new structural properties of the ...