Sciweavers

1298 search results - page 86 / 260
» The online set cover problem
Sort
View
SIROCCO
2004
15 years 7 months ago
Existence of Nash Equilibria in Selfish Routing Problems
The problem of routing traffic through a congested network is studied. The framework is that introduced by Koutsoupias and Papadimitriou where the network is constituted by m paral...
Alessandro Ferrante, Mimmo Parente
PG
1999
IEEE
15 years 10 months ago
Automatic Camera Placement for Image-Based Modeling
We present an automatic camera placement method for generating image-based models from scenes with known geometry. Our method first approximately determines the set of surfaces vi...
Shachar Fleishman, Daniel Cohen-Or, Dani Lischinsk...
IMC
2007
ACM
15 years 8 months ago
Acyclic type-of-relationship problems on the internet: an experimental analysis
An experimental study of the feasibility and accuracy of the acyclicity approach introduced in [14] for the inference of business relationships among autonomous systems (ASes) is ...
Benjamin Hummel, Sven Kosub
CIKM
2008
Springer
15 years 8 months ago
Multi-aspect expertise matching for review assignment
Review assignment is a common task that many people such as conference organizers, journal editors, and grant administrators would have to do routinely. As a computational problem...
Maryam Karimzadehgan, ChengXiang Zhai, Geneva G. B...
ESA
2006
Springer
136views Algorithms» more  ESA 2006»
15 years 10 months ago
Approximation in Preemptive Stochastic Online Scheduling
Abstract. We present a first constant performance guarantee for preemptive stochastic scheduling to minimize the sum of weighted completion times. For scheduling jobs with release ...
Nicole Megow, Tjark Vredeveld