Sciweavers

1381 search results - page 195 / 277
» Computational Complexity of Constraint Satisfaction
Sort
View
AAAI
2004
13 years 11 months ago
Low-Knowledge Algorithm Control
This paper addresses the question of allocating computational resources among a set of algorithms in order to achieve the best performance on a scheduling problem instance. Our pr...
Tom Carchrae, J. Christopher Beck
AUTOMATICA
2010
110views more  AUTOMATICA 2010»
13 years 10 months ago
Moving-horizon partition-based state estimation of large-scale systems
This paper presents three novel Moving Horizon Estimation (MHE) methods for discrete-time partitioned linear systems, i.e. systems decomposed into coupled subsystems with non-over...
Marcello Farina, Giancarlo Ferrari-Trecate, Riccar...
COR
2008
116views more  COR 2008»
13 years 10 months ago
Robust multiperiod portfolio management in the presence of transaction costs
We study the viability of different robust optimization approaches to multiperiod portfolio selection. Robust optimization models treat future asset returns as uncertain coefficie...
Dimitris Bertsimas, Dessislava Pachamanova
TGIS
2008
69views more  TGIS 2008»
13 years 10 months ago
Spatial-Scene Similarity Queries
Assessing spatial scenes for similarity is difficult from a cognitive and computational perspective. Solutions to spatial-scene similarity assessments are sensible only if corresp...
Konstantinos A. Nedas, Max J. Egenhofer
ICASSP
2011
IEEE
13 years 1 months ago
Using F0 to constrain the unit selection Viterbi network
The goal of the work described here is to limit the computation needed in unit selection Viterbi search for text-to-speech synthesis. The broader goal is to improve speech quality...
Alistair Conkie, Ann K. Syrdal