Sciweavers

2354 search results - page 168 / 471
» Assignment Problems
Sort
View
RSA
2010
118views more  RSA 2010»
15 years 3 months ago
Weight of a link in a shortest path tree and the Dedekind Eta function
The weight of a randomly chosen link in the shortest path tree on the complete graph with exponential i.i.d. link weights is studied. The corresponding exact probability generatin...
Piet Van Mieghem
PPAM
2005
Springer
15 years 10 months ago
Two Level Job-Scheduling Strategies for a Computational Grid
Abstract. We address parallel jobs scheduling problem for computational GRID systems. We concentrate on two-level hierarchy scheduling: at the first level broker allocates computa...
Andrei Tchernykh, Juan Manuel Ramírez, Arut...
SOFSEM
2004
Springer
15 years 10 months ago
Discovery of Lexical Entries for Non-taxonomic Relations in Ontology Learning
Ontology learning from texts has recently been proposed as a new technology helping ontology designers in the modelling process. Discovery of non–taxonomic relations is understoo...
Martin Kavalec, Alexander Maedche, Vojtech Sv&aacu...
WAOA
2004
Springer
141views Algorithms» more  WAOA 2004»
15 years 10 months ago
Strong Colorings of Hypergraphs
Abstract. A strong vertex coloring of a hypergraph assigns distinct colors to vertices that are contained in a common hyperedge. This captures many previously studied graph colorin...
Geir Agnarsson, Magnús M. Halldórsso...
WAOA
2010
Springer
251views Algorithms» more  WAOA 2010»
15 years 3 months ago
How to Play Unique Games on Expanders
In this paper, we improve a result by Arora, Khot, Kolla, Steurer, Tulsiani, and Vishnoi on solving the Unique Games problem on expanders. Given a (1-)-satisfiable instance of Uniq...
Konstantin Makarychev, Yury Makarychev