Sciweavers

6455 search results - page 227 / 1291
» Research problems
Sort
View
SRDS
1996
IEEE
15 years 10 months ago
Exploiting Data-Flow for Fault-Tolerance in a Wide-Area Parallel System
Wide-area parallel processing systems will soon be available to researchers to solve a range of problems. In these systems, it is certain that host failures and other faults will ...
Anh Nguyen-Tuong, Andrew S. Grimshaw, Mark Hyett
DATESO
2010
148views Database» more  DATESO 2010»
15 years 4 months ago
Using Spectral Clustering for Finding Students' Patterns of Behavior in Social Networks
Abstract. The high dimensionality of the data generated by social networks has been a big challenge for researchers. In order to solve the problems associated with this phenomenon,...
Gamila Obadi, Pavla Drázdilová, Jan ...
CSR
2008
Springer
15 years 6 months ago
Colouring, constraint satisfaction, and complexity
Constraint satisfaction problems have enjoyed much attention since the early seventies, and in the last decade have become also a focus of attention amongst theoreticians. Graph c...
Pavol Hell, Jaroslav Nesetril
CEC
2009
IEEE
16 years 1 months ago
When is an estimation of distribution algorithm better than an evolutionary algorithm?
—Despite the wide-spread popularity of estimation of distribution algorithms (EDAs), there has been no theoretical proof that there exist optimisation problems where EDAs perform...
Tianshi Chen, Per Kristian Lehre, Ke Tang, Xin Yao
IJCNN
2006
IEEE
16 years 16 days ago
Learning to Rank by Maximizing AUC with Linear Programming
— Area Under the ROC Curve (AUC) is often used to evaluate ranking performance in binary classification problems. Several researchers have approached AUC optimization by approxi...
Kaan Ataman, W. Nick Street, Yi Zhang