Sciweavers

2799 search results - page 147 / 560
» The regenerator location problem
Sort
View
96
Voted
ICRA
2008
IEEE
117views Robotics» more  ICRA 2008»
15 years 7 months ago
Tracking hidden agents through shadow information spaces
— This paper addresses problems of inferring the locations of moving agents from combinatorial data extracted by robots that carry sensors. The agents move unpredictably and may ...
Jingjin Yu, Steven M. LaValle
110
Voted
ISORC
2008
IEEE
15 years 7 months ago
Obstacles in Worst-Case Execution Time Analysis
The analysis of the worst-case execution time (WCET) requires detailed knowledge of the program behavior. In practice it is still not possible to obtain all needed information aut...
Raimund Kirner, Peter P. Puschner
CLEANDB
2006
ACM
112views Database» more  CLEANDB 2006»
15 years 4 months ago
Generic Entity Resolution with Data Confidences
We consider the Entity Resolution (ER) problem (also known as deduplication, or merge-purge), in which records determined to represent the same real-world entity are successively ...
David Menestrina, Omar Benjelloun, Hector Garcia-M...
CPM
2006
Springer
143views Combinatorics» more  CPM 2006»
15 years 4 months ago
Algorithms for Finding a Most Similar Subforest
Given an ordered labeled forest F ("the target forest") and an ordered labeled forest G ("the pattern forest"), the most similar subforest problem is to find a ...
Jesper Jansson, Zeshan Peng
107
Voted
HIS
2008
15 years 2 months ago
Neural Plasticity and Minimal Topologies for Reward-Based Learning
Artificial Neural Networks for online learning problems are often implemented with synaptic plasticity to achieve adaptive behaviour. A common problem is that the overall learning...
Andrea Soltoggio