Sciweavers

2286 search results - page 247 / 458
» Algorithms for Categorical Equivalence
Sort
View
WADS
2007
Springer
130views Algorithms» more  WADS 2007»
16 years 23 days ago
Approximating the Maximum Sharing Problem
In the maximum sharing problem (MS), we want to compute a set of (non-simple) paths in an undirected bipartite graph covering as many nodes as possible of the first layer of the ...
Amitabh Chaudhary, Danny Z. Chen, Rudolf Fleischer...
DATE
2006
IEEE
120views Hardware» more  DATE 2006»
16 years 22 days ago
System-level scheduling on instruction cell based reconfigurable systems
This paper presents a new operation chaining reconfigurable scheduling algorithm (CRS) based on list scheduling that maximizes instruction level parallelism available in distribut...
Ying Yi, Ioannis Nousias, Mark Milward, Sami Khawa...
IJCNN
2006
IEEE
16 years 21 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
AAIM
2006
Springer
94views Algorithms» more  AAIM 2006»
16 years 19 days ago
Some Basics on Tolerances
In this note we deal with sensitivity analysis of combinatorial optimization problems and its fundamental term, the tolerance. For three classes of objective functions (Σ, Π, MA...
Boris Goldengorin, Gerold Jäger, Paul Molitor
INFOSCALE
2006
ACM
16 years 19 days ago
Scheduling divisible loads in the dynamic heterogeneous grid environment
According to the special features of the dynamic heterogeneous grid environment, a loose-coupled and scalable resource model is described by a hybrid multi-level tree reflecting a...
Tao Zhu, Yongwei Wu, Guangwen Yang