Sciweavers

3471 search results - page 15 / 695
» Obstacle Numbers of Graphs
Sort
View
IROS
2006
IEEE
168views Robotics» more  IROS 2006»
14 years 1 months ago
Learning to Drive Among Obstacles
— This paper reports on an outdoor mobile robot that learns to avoid collisions by observing a human driver operate a vehicle equipped with sensors that continuously produce a ma...
Bradley Hamner, Sebastian Scherer, Sanjiv Singh
COLT
1993
Springer
13 years 12 months ago
Piecemeal Learning of an Unknown Environment
We introducea new learningproblem: learninga graph by piecemeal search, in which the learner must return every so often to its starting point (for refueling, say). We present two l...
Margrit Betke, Ronald L. Rivest, Mona Singh
RIDE
2002
IEEE
14 years 24 days ago
ebXML: Status, Research Issues, and Obstacles
Technologies and approaches in the field of Electronic Commerce are not mature enough in order to allow for their broad successful commercial application. Neither existing, succes...
Birgit Hofreiter, Christian Huemer, Wolfgang Klas
FAW
2009
Springer
180views Algorithms» more  FAW 2009»
14 years 2 months ago
Edge Search Number of Cographs in Linear Time
We give a linear-time algorithm for computing the edge search number of cographs, thereby proving that this problem can be solved in polynomial time on this graph class. With our ...
Pinar Heggernes, Rodica Mihai
RECOMB
2007
Springer
14 years 8 months ago
An Efficient and Accurate Graph-Based Approach to Detect Population Substructure
Currently, large-scale projects are underway to perform whole genome disease association studies. Such studies involve the genotyping of hundreds of thousands of SNP markers. One o...
Srinath Sridhar, Satish Rao, Eran Halperin