Sciweavers

2526 search results - page 212 / 506
» A Comparative Evaluation of Name-Matching Algorithms
Sort
View
CEC
2009
IEEE
16 years 1 months ago
Tackling high dimensional nonseparable optimization problems by cooperatively coevolving particle swarms
— This paper attempts to address the question of scaling up Particle Swarm Optimization (PSO) algorithms to high dimensional optimization problems. We present a cooperative coevo...
Xiaodong Li, Xin Yao
ICASSP
2007
IEEE
16 years 26 days ago
A New Rotation Search for Dependent Rate-Distortion Optimization in Video Coding
We present a novel search algorithm which is suitable for optimizing functions with a high-dimensional discrete-valued parameter vector. The algorithm is designed to find a funct...
Tuukka Toivonen, Loren Merritt, Ville Ojansivu, Ja...
INFOCOM
2003
IEEE
15 years 11 months ago
Multipoint-to-Point Session Fairness in the Internet
— In the current Internet, many applications start sessions with multiple connections to multiple servers in order to expedite the reception of data. One may argue that such aggr...
Pradnya Karbhari, Ellen W. Zegura, Mostafa H. Amma...
HIPC
2003
Springer
15 years 11 months ago
Combined Scheduling of Hard and Soft Real-Time Tasks in Multiprocessor Systems
Many complex real-time applications involve combined scheduling of hard and soft real-time tasks. In this paper, we propose a combined scheduling algorithm, called Emergency Algori...
Basheer Al-Duwairi, Govindarasu Manimaran
DIS
2006
Springer
15 years 10 months ago
Clustering Pairwise Distances with Missing Data: Maximum Cuts Versus Normalized Cuts
Abstract. Clustering algorithms based on a matrix of pairwise similarities (kernel matrix) for the data are widely known and used, a particularly popular class being spectral clust...
Jan Poland, Thomas Zeugmann