Sciweavers

1568 search results - page 231 / 314
» The problem of examination questions in algorithmics
Sort
View
AIPS
2009
15 years 5 months ago
Navigation Planning in Probabilistic Roadmaps with Uncertainty
Probabilistic Roadmaps (PRM) are a commonly used class of algorithms for robot navigation tasks where obstacles are present in the environment. We examine the situation where the ...
Michael Kneebone, Richard Dearden
EOR
2008
78views more  EOR 2008»
15 years 4 months ago
Maximizing throughput in queueing networks with limited flexibility
We study a queueing network where customers go through several stages of processing, with the class of a customer used to indicate the stage of processing. The customers are servic...
Douglas G. Down, George Karakostas
IJAR
2010
153views more  IJAR 2010»
15 years 2 months ago
Diagnosis of dyslexia with low quality data with genetic fuzzy systems
For diagnosing dyslexia in early childhood, children have to solve non-writing based, graphical tests. Curently, these tests are processed by a human expert; applying artificial ...
Ana M. Palacios, Luciano Sánchez, Iné...
JUCS
2010
130views more  JUCS 2010»
15 years 2 months ago
On the Linear Number of Matching Substrings
Abstract: We study the number of matching substrings in the pattern matching problem. In general, there can be a quadratic number of matching substrings in the size of a given text...
Yo-Sub Han
ICCV
2009
IEEE
15 years 2 months ago
Realtime background subtraction from dynamic scenes
This paper examines the problem of moving object detection. More precisely, it addresses the difficult scenarios where background scene textures in the video might change over tim...
Li Cheng, Minglun Gong