Sciweavers

157 search results - page 30 / 32
» SLIDE: A Useful Special Case of the CARDPATH Constraint
Sort
View
ALGORITHMICA
2002
120views more  ALGORITHMICA 2002»
13 years 8 months ago
An Experimental Study of Algorithms for Weighted Completion Time Scheduling
We consider the total weighted completion time scheduling problem for parallel identical machines and precedence constraints, P jprecj PwiCi. This important and broad class of pro...
Ivan D. Baev, Waleed Meleis, Alexandre E. Eichenbe...
ESA
2010
Springer
207views Algorithms» more  ESA 2010»
13 years 9 months ago
Budgeted Red-Blue Median and Its Generalizations
In a Content Distribution Network application, we have a set of servers and a set of clients to be connected to the servers. Often there are a few server types and a hard budget co...
MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kor...
EGC
2005
Springer
14 years 2 months ago
A Grid Architecture for Comfortable Robot Control
This paper describes a research project about robot control across a computing Grid, first step toward a Grid solution for generic process control. A computational Grid can signi...
Stéphane Vialle, Amelia De Vivo, Fabrice Sa...
WAW
2004
Springer
178views Algorithms» more  WAW 2004»
14 years 2 months ago
Communities Detection in Large Networks
We develop an algorithm to detect community structure in complex networks. The algorithm is based on spectral methods and takes into account weights and links orientations. Since t...
Andrea Capocci, Vito Domenico Pietro Servedio, Gui...
SPAA
2003
ACM
14 years 1 months ago
Short length menger's theorem and reliable optical routing
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...
Amitabha Bagchi, Amitabh Chaudhary, Petr Kolman