Sciweavers

14165 search results - page 62 / 2833
» The generalized two-server problem
Sort
View
125
Voted
SODA
1997
ACM
119views Algorithms» more  SODA 1997»
15 years 4 months ago
Map Labeling and Its Generalizations
Map labeling is of fundamental importance in cartography and geographical information systems and is one of the areas targeted for research by the ACM Computational Geometry Impac...
Srinivas Doddi, Madhav V. Marathe, Andy Mirzaian, ...
136
Voted
COR
2006
96views more  COR 2006»
15 years 3 months ago
Scheduling two parallel machines with a single server: the general case
This paper considers the problem of scheduling two-operation non-preemptable jobs on two identical semiautomatic machines. A single server is available to carry out the first (or ...
Amir H. Abdekhodaee, Andrew Wirth, Heng-Soon Gan
146
Voted
APPROX
2009
Springer
138views Algorithms» more  APPROX 2009»
15 years 10 months ago
Submodular Maximization over Multiple Matroids via Generalized Exchange Properties
Submodular-function maximization is a central problem in combinatorial optimization, generalizing many important NP-hard problems including Max Cut in digraphs, graphs and hypergr...
Jon Lee, Maxim Sviridenko, Jan Vondrák
STOC
1999
ACM
132views Algorithms» more  STOC 1999»
15 years 7 months ago
A Polynomial Combinatorial Algorithm for Generalized Minimum Cost Flow
We propose the first combinatorial solution to one of the most classic problems in combinatorial optimization: the generalized minimum cost flow problem (flow with losses and g...
Kevin D. Wayne
149
Voted
AGENTS
1999
Springer
15 years 7 months ago
General Principles of Learning-Based Multi-Agent Systems
We consider the problem of how to design large decentralized multiagent systems (MAS’s) in an automated fashion, with little or no hand-tuning. Our approach has each agent run a...
David Wolpert, Kevin R. Wheeler, Kagan Tumer