Sciweavers

836 search results - page 25 / 168
» On the Complexity of Train Assignment Problems
Sort
View
137
Voted
IAT
2005
IEEE
15 years 9 months ago
Coordinating Non Cooperative Planning Agents: Complexity Results
Whenever independent, non-cooperative actors jointly have to solve a complex task, they need to coordinate their efforts. Typical examples of such task coordination problems are s...
Adriaan ter Mors, Cees Witteveen
142
Voted
CRV
2009
IEEE
115views Robotics» more  CRV 2009»
15 years 10 months ago
Learning Model Complexity in an Online Environment
In this paper we introduce the concept and method for adaptively tuning the model complexity in an online manner as more examples become available. Challenging classification pro...
Dan Levi, Shimon Ullman
153
Voted
IJCAI
2007
15 years 5 months ago
Simple Training of Dependency Parsers via Structured Boosting
Recently, significant progress has been made on learning structured predictors via coordinated training algorithms such as conditional random fields and maximum margin Markov ne...
Qin Iris Wang, Dekang Lin, Dale Schuurmans
110
Voted
INTERSPEECH
2010
14 years 10 months ago
Context adaptive training with factorized decision trees for HMM-based speech synthesis
To achieve natural high quality synthesised speech in HMMbased speech synthesis, the effective modelling of complex acoustic and linguistic contexts is critical. Traditional appro...
Kai Yu, Heiga Zen, François Mairesse, Steve...
182
Voted
GECCO
2011
Springer
270views Optimization» more  GECCO 2011»
14 years 7 months ago
Geometric surrogate-based optimisation for permutation-based problems
In continuous optimisation, surrogate models (SMs) are used when tackling real-world problems whose candidate solutions are expensive to evaluate. In previous work, we showed that...
Alberto Moraglio, Yong-Hyuk Kim, Yourim Yoon