Sciweavers

451 search results - page 5 / 91
» Update on economic approach to simulation selection problems
Sort
View
LION
2010
Springer
190views Optimization» more  LION 2010»
13 years 10 months ago
Algorithm Selection as a Bandit Problem with Unbounded Losses
Abstract. Algorithm selection is typically based on models of algorithm performance learned during a separate offline training sequence, which can be prohibitively expensive. In r...
Matteo Gagliolo, Jürgen Schmidhuber
MDM
2009
Springer
121views Communications» more  MDM 2009»
14 years 24 days ago
Lazy-Update B+-Tree for Flash Devices
— With the rapid increasing capacity of flash chips, flash-aware indexing techniques are highly desirable for flash devices. The unique features of flash memory, such as the ...
Sai Tung On, Haibo Hu, Yu Li, Jianliang Xu
IJON
2008
177views more  IJON 2008»
13 years 6 months ago
An asynchronous recurrent linear threshold network approach to solving the traveling salesman problem
In this paper, an approach to solving the classical Traveling Salesman Problem (TSP) using a recurrent network of linear threshold (LT) neurons is proposed. It maps the classical ...
Eu Jin Teoh, Kay Chen Tan, H. J. Tang, Cheng Xiang...
CCE
2007
13 years 6 months ago
Generate Pareto optimal solutions of scheduling problems using normal boundary intersection technique
The problem of short-term scheduling under uncertainty is addressed in this paper through a multiobjective optimization framework that incorporates economic expectation, robustnes...
Zhenya Jia, Marianthi G. Ierapetritou
ITS
2000
Springer
94views Multimedia» more  ITS 2000»
13 years 9 months ago
DT Tutor: A Decision-Theoretic, Dynamic Approach for Optimal Selection of Tutorial Actions
DT Tutor uses a decision-theoretic approach to select tutorial actions for coached problem solving that are optimal given the tutor's beliefs and objectives. It employs a mode...
R. Charles Murray, Kurt VanLehn