3016 search results - page 544 / 604 » The Online Transportation Problem |
102
click to vote
FOCS
2008
IEEE
15 years 28 days ago
2008
IEEE
Given a universe U of n elements and a weighted collection S of m subsets of U, the universal set cover problem is to a-priori map each element u ∈ U to a set S(u) ∈ S contain...
115
click to vote
JMLR
2008
14 years 12 months ago
2008
When monitoring spatial phenomena, which can often be modeled as Gaussian processes (GPs), choosing sensor locations is a fundamental task. There are several common strategies to ...
IJRR
2007
14 years 11 months ago
2007
Efficient algorithms for collision-free energy sub-optimal path planning for formations of spacecraft flying in deep space are presented. The idea is to introduce a set of way-poi...
102
click to vote
TIT
2002
14 years 11 months ago
2002
The problem of optimal sequential decision for individual sequences, relative to a class of competing o -line reference strategies, is studied for general loss functions with memo...
109
click to vote
SIGMOD
2010
ACM
14 years 10 months ago
2010
ACM
Tuning tools attempt to configure a database to achieve optimal performance for a given workload. Selecting an optimal set of physical structures is computationally hard since it ...