Sciweavers

383 search results - page 7 / 77
» Learning Model Complexity in an Online Environment
Sort
View
100
Voted
ICALP
2011
Springer
14 years 1 months ago
On the Advice Complexity of the k-Server Problem
Competitive analysis is the established tool for measuring the output quality of algorithms that work in an online environment. Recently, the model of advice complexity has been in...
Hans-Joachim Böckenhauer, Dennis Komm, Rastis...
EDUTAINMENT
2006
Springer
15 years 1 months ago
Research of Dynamic Terrain in Complex Battlefield Environments
In this paper, we present a novel method for dynamic terrain in battlefield and an efficient plan to simulate crater in the battle. We explore a few methods for dynamic terrain sur...
Xingquan Cai, Fengxia Li, Haiyan Sun, Shouyi Zhan
AROBOTS
2002
91views more  AROBOTS 2002»
14 years 9 months ago
Fast, On-Line Learning of Globally Consistent Maps
To navigate in unknown environments, mobile robots require the ability to build their own maps. A major problem for robot map building is that odometry-based dead reckoning cannot ...
Tom Duckett, Stephen Marsland, Jonathan Shapiro
ICALT
2005
IEEE
15 years 3 months ago
MALESAbrain for Problem-Based Learning in IT Education
This paper reports MALESAbrain an intelligent online tool for problem-based learning (PBL) in IT education. The learning model of MALESAbrain is built on the notions of threshold ...
Akcell Chiang, Mohd Sapiyan Baba
JMLR
2012
12 years 12 months ago
Online Incremental Feature Learning with Denoising Autoencoders
While determining model complexity is an important problem in machine learning, many feature learning algorithms rely on cross-validation to choose an optimal number of features, ...
Guanyu Zhou, Kihyuk Sohn, Honglak Lee