Sciweavers

770 search results - page 154 / 154
» Latent Class Models for Algorithm Portfolio Methods
Sort
View
ATAL
2010
Springer
13 years 6 months ago
Frequency adjusted multi-agent Q-learning
Multi-agent learning is a crucial method to control or find solutions for systems, in which more than one entity needs to be adaptive. In today's interconnected world, such s...
Michael Kaisers, Karl Tuyls
HEURISTICS
2008
124views more  HEURISTICS 2008»
13 years 5 months ago
A variable neighborhood search for the capacitated arc routing problem with intermediate facilities
In this talk we present a unified Variable Neighborhood Search (VNS) algorithm for the Capacitated Arc Routing Problem (CARP) and some of its variants - the Capacitated Arc Routin...
Michael Polacek, Karl F. Doerner, Richard F. Hartl...
BMCBI
2010
150views more  BMCBI 2010»
13 years 5 months ago
DeltaProt: a software toolbox for comparative genomics
Background: Statistical bioinformatics is the study of biological data sets obtained by new micro-technologies by means of proper statistical methods. For a better understanding o...
Steinar Thorvaldsen, Tor Flå, Nils Willassen
CORR
2011
Springer
219views Education» more  CORR 2011»
13 years 17 days ago
Active Markov Information-Theoretic Path Planning for Robotic Environmental Sensing
Recent research in multi-robot exploration and mapping has focused on sampling environmental fields, which are typically modeled using the Gaussian process (GP). Existing informa...
Kian Hsiang Low, John M. Dolan, Pradeep K. Khosla
PAMI
2010
139views more  PAMI 2010»
13 years 4 months ago
Order-Preserving Moves for Graph-Cut-Based Optimization
— In the last decade, graph-cut optimization has been popular for a variety of labeling problems. Typically graph-cut methods are used to incorporate smoothness constraints on a ...
Xiaoqing Liu, Olga Veksler, Jagath Samarabandu