Sciweavers

2566 search results - page 338 / 514
» The Online Median Problem
Sort
View
APPROX
2005
Springer
103views Algorithms» more  APPROX 2005»
16 years 2 days ago
Where's the Winner? Max-Finding and Sorting with Metric Costs
Traditionally, a fundamental assumption in evaluating the performance of algorithms for sorting and selection has been that comparing any two elements costs one unit (of time, work...
Anupam Gupta, Amit Kumar
SPAA
2004
ACM
15 years 12 months ago
Fighting against two adversaries: page migration in dynamic networks
Page migration is one of the fundamental subproblems in the framework of data management in networks. It occurs in a distributed network of processors sharing one indivisible memo...
Marcin Bienkowski, Miroslaw Korzeniowski, Friedhel...
AH
2004
Springer
15 years 12 months ago
Adaptive Navigation for Self-assessment Quizzes
Web-based parameterized quizzes provide teachers and students with several advantages as the technology for self-assessment. However, the effect of these advantages is strongly red...
Sergey A. Sosnovsky
IWANN
1999
Springer
15 years 10 months ago
Using Temporal Neighborhoods to Adapt Function Approximators in Reinforcement Learning
To avoid the curse of dimensionality, function approximators are used in reinforcement learning to learn value functions for individual states. In order to make better use of comp...
R. Matthew Kretchmar, Charles W. Anderson
ECAI
2006
Springer
15 years 10 months ago
Automatic Term Categorization by Extracting Knowledge from the Web
This paper addresses the problem of categorizing terms or lexical entities into a predefined set of semantic domains exploiting the knowledge available on-line in the Web. The prop...
Leonardo Rigutini, Ernesto Di Iorio, Marco Ernande...