1316 search results - page 249 / 264 » Comparing mathematical models on the problem of network infe... |
106
Voted
ATAL
2010
Springer
15 years 24 days ago
2010
Springer
We consider the problem of allocating networked resources in dynamic environment, such as cloud computing platforms, where providers strategically price resources to maximize thei...
108
click to vote
ATMOS
2010
14 years 10 months ago
2010
Train Routing is a problem that arises in the early phase of the passenger railway planning process, usually several months before operating the trains. The main goal is to assign...
131
click to vote
SDM
2012
SIAM
13 years 2 months ago
2012
SIAM
We propose a new matrix completion algorithm— Kernelized Probabilistic Matrix Factorization (KPMF), which effectively incorporates external side information into the matrix fac...
PODC
2009
ACM
16 years 7 days ago
2009
ACM
In the interference scheduling problem, one is given a set of n communication requests described by pairs of points from a metric space. The points correspond to devices in a wire...
AIPS
2000
15 years 1 months ago
2000
1 We consider the problem of scheduling an unknown sequence of tasks for a single server as the tasks arrive with the goal off maximizing the total weighted value of the tasks serv...