Sciweavers

3016 search results - page 115 / 604
» The Online Transportation Problem
Sort
View
108
Voted
UAI
1997
15 years 5 months ago
Time-Critical Action: Representations and Application
We review the problem of time-critical action and discuss a reformulation that shifts knowledge acquisition from the assessment of complex temporal probabilistic dependencies to t...
Eric Horvitz, Adam Seiver
AMC
2008
111views more  AMC 2008»
15 years 4 months ago
A domain decomposition method for the Oseen-viscoelastic flow equations
We study a non-overlapping domain decomposition method for the Oseen-viscoelastic flow problem. The data on the interface are transported through Newmann and Dirichlet boundary co...
Eleanor Jenkins, Hyesuk Lee
JOIN
2007
91views more  JOIN 2007»
15 years 3 months ago
An Optimal Rebuilding Strategy for an Incremental Tree Problem
This paper is devoted to the following incremental problem. Initially, a graph and a distinguished subset of vertices, called initial group, are given. This group is connected by ...
Nicolas Thibault, Christian Laforest
155
Voted
SODA
2008
ACM
185views Algorithms» more  SODA 2008»
15 years 5 months ago
Better bounds for online load balancing on unrelated machines
We study the problem of scheduling permanent jobs on unrelated machines when the objective is to minimize the Lp norm of the machine loads. The problem is known as load balancing ...
Ioannis Caragiannis
JAIR
2008
130views more  JAIR 2008»
15 years 3 months ago
Online Planning Algorithms for POMDPs
Partially Observable Markov Decision Processes (POMDPs) provide a rich framework for sequential decision-making under uncertainty in stochastic domains. However, solving a POMDP i...
Stéphane Ross, Joelle Pineau, Sébast...