Sciweavers

1578 search results - page 238 / 316
» Direct Routing: Algorithms and Complexity
Sort
View
CORR
2011
Springer
172views Education» more  CORR 2011»
13 years 5 months ago
Improving Strategies via SMT Solving
We consider the problem of computing numerical invariants of programs by abstract interpretation. Our method eschews two traditional sources of imprecision: (i) the use of widenin...
Thomas Martin Gawlitza, David Monniaux
JMLR
2010
169views more  JMLR 2010»
13 years 4 months ago
Consensus-Based Distributed Support Vector Machines
This paper develops algorithms to train support vector machines when training data are distributed across different nodes, and their communication to a centralized processing unit...
Pedro A. Forero, Alfonso Cano, Georgios B. Giannak...
ECIR
2011
Springer
13 years 1 months ago
Balancing Exploration and Exploitation in Learning to Rank Online
Abstract. As retrieval systems become more complex, learning to rank approaches are being developed to automatically tune their parameters. Using online learning to rank approaches...
Katja Hofmann, Shimon Whiteson, Maarten de Rijke
VIS
2009
IEEE
205views Visualization» more  VIS 2009»
14 years 11 months ago
Time and Streak Surfaces for Flow Visualization in Large Time-Varying Data Sets
Time and streak surfaces are ideal tools to illustrate time-varying vector fields since they directly appeal to the intuition about coherently moving particles. However, efficient ...
Hari Krishnan, Christoph Garth, Kenneth I. Joy
ATAL
2007
Springer
14 years 4 months ago
Estimating information value in collaborative multi-agent planning systems
This paper addresses the problem of identifying the value of information held by a teammate on a distributed, multi-agent team. It focuses on a distributed scheduling task in whic...
David Sarne, Barbara J. Grosz