Sciweavers

904 search results - page 104 / 181
» Scheduling task graphs optimally with A
Sort
View
IAT
2009
IEEE
14 years 22 days ago
Multi-a(ge)nt Graph Patrolling and Partitioning
We introduce a novel multi agent patrolling algorithm inspired by the behavior of gas filled balloons. Very low capability ant-like agents are considered with the task of patrolli...
Yotam Elor, Alfred M. Bruckstein
JGAA
2007
135views more  JGAA 2007»
13 years 8 months ago
Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Dat
Graphs are an extremely general and powerful data structure. In pattern recognition and computer vision, graphs are used to represent patterns to be recognized or classified. Det...
Donatello Conte, Pasquale Foggia, Mario Vento
PAMI
2007
202views more  PAMI 2007»
13 years 8 months ago
Weighted Graph Cuts without Eigenvectors A Multilevel Approach
—A variety of clustering algorithms have recently been proposed to handle data that is not linearly separable; spectral clustering and kernel k-means are two of the main methods....
Inderjit S. Dhillon, Yuqiang Guan, Brian Kulis
4OR
2004
99views more  4OR 2004»
13 years 8 months ago
Upper bounds for revenue maximization in a satellite scheduling problem
This paper presents upper bounds for the Satellite Revenue Selection and Scheduling problem (SRSS). A compact model of this generalized Prize Collecting Traveling Salesman Problem ...
Thierry Benoist, Benoît Rottembourg
PPL
2007
71views more  PPL 2007»
13 years 8 months ago
Scheduling Algorithms for Data Redistribution and Load-Balancing on Master-Slave Platforms
In this work we are interested in the problem of scheduling and redistributing data on master-slave platforms. We consider the case were the workers possess initial loads, some of...
Loris Marchal, Veronika Rehn, Yves Robert, Fr&eacu...