Sciweavers

4679 search results - page 597 / 936
» Modeling When Connections Are the Problem
Sort
View
ICDT
2007
ACM
118views Database» more  ICDT 2007»
15 years 10 months ago
Approximate Data Exchange
Abstract. We introduce approximate data exchange, by relaxing classical data exchange problems such as Consistency and Typechecking to their approximate versions based on Property ...
Michel de Rougemont, Adrien Vieilleribière
APPROX
2006
Springer
124views Algorithms» more  APPROX 2006»
15 years 10 months ago
Combinatorial Algorithms for Data Migration to Minimize Average Completion Time
The data migration problem is to compute an efficient plan for moving data stored on devices in a network from one configuration to another. It is modeled by a transfer graph, wher...
Rajiv Gandhi, Julián Mestre
175
Voted
AAAI
2008
15 years 9 months ago
Transfer Learning via Dimensionality Reduction
Transfer learning addresses the problem of how to utilize plenty of labeled data in a source domain to solve related but different problems in a target domain, even when the train...
Sinno Jialin Pan, James T. Kwok, Qiang Yang
AAAI
2008
15 years 9 months ago
An Efficient Motion Planning Algorithm for Stochastic Dynamic Systems with Constraints on Probability of Failure
When controlling dynamic systems, such as mobile robots in uncertain environments, there is a trade off between risk and reward. For example, a race car can turn a corner faster b...
Masahiro Ono, Brian C. Williams
APPROX
2008
Springer
127views Algorithms» more  APPROX 2008»
15 years 8 months ago
Approximating Single Machine Scheduling with Scenarios
In the field of robust optimization, the goal is to provide solutions to combinatorial problems that hedge against variations of the numerical parameters. This constitutes an effor...
Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svenss...