Sciweavers

1658 search results - page 31 / 332
» Learning Unknown Graphs
Sort
View
LEGE
2004
103views Education» more  LEGE 2004»
15 years 3 months ago
Structuring and merging Distributed Content
A flexible approach for structuring and merging distributed learning object is presented. At the basis of this approach there is a formal representation of a learning object, call...
Luca Stefanutti, Dietrich Albert, Cord Hockemeyer
CORR
2010
Springer
187views Education» more  CORR 2010»
15 years 2 months ago
Learning in A Changing World: Non-Bayesian Restless Multi-Armed Bandit
We consider the restless multi-armed bandit (RMAB) problem with unknown dynamics. In this problem, at each time, a player chooses K out of N (N > K) arms to play. The state of ...
Haoyang Liu, Keqin Liu, Qing Zhao
ICRA
2009
IEEE
164views Robotics» more  ICRA 2009»
15 years 8 months ago
Information retrieval system for human-robot communication - Asking for directions
— The creation of a robot capable of navigating in unknown urban environments without the use of GPS data or prior map knowledge is envisioned in the Autonomous City Explorer (AC...
Andrea Maria Bauer, Dirk Wollherr, Martin Buss
ISSTA
2000
ACM
15 years 6 months ago
OMEN: A strategy for testing object-oriented software
This paper presents a strategy for structural testing of objectoriented software systems with possibly unknown clients and unknown information about invoked methods. By exploiting...
Amie L. Souter, Lori L. Pollock
AE
2003
Springer
15 years 7 months ago
Optimising Graph Partitions Using Parallel Evolution
Abstract. The graph partitioning problem consists of dividing the vertices of a graph into a set of balanced parts, such that the number of edges connecting vertices in different ...
Raul Baños, Consolación Gil, Julio O...