Sciweavers

461 search results - page 79 / 93
» Practical polynomial factoring in polynomial time
Sort
View
STACS
2007
Springer
14 years 1 months ago
New Approximation Algorithms for Minimum Cycle Bases of Graphs
We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed ...
Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Mich...
PC
2008
123views Management» more  PC 2008»
13 years 7 months ago
The impact of heterogeneity on master-slave scheduling
In this paper, we assess the impact of heterogeneity on scheduling independent tasks on master-slave platforms. We assume a realistic one-port model where the master can communica...
Jean-Francois Pineau, Yves Robert, Fréd&eac...
ATAL
2007
Springer
14 years 1 months ago
Approximate and online multi-issue negotiation
This paper analyzes bilateral multi-issue negotiation between selfinterested autonomous agents. The agents have time constraints in the form of both deadlines and discount factors...
S. Shaheen Fatima, Michael Wooldridge, Nicholas R....
ECAI
2010
Springer
13 years 6 months ago
Local search algorithms on the Stable Marriage Problem: Experimental Studies
The stable marriage problem (SM) has a wide variety of practical applications, ranging from matching resident doctors to hospitals, to matching students to schools, or more general...
Mirco Gelain, Maria Silvia Pini, Francesca Rossi, ...
RTSS
1992
IEEE
13 years 11 months ago
Allocation of periodic task modules with precedence and deadline constraints in distributed real-time systems
This paper addresses the problem of allocating (assigning and scheduling) periodic task modules to processing nodes in distributed real-time systems subject to task precedence and ...
Chao-Ju Hou, Kang G. Shin