Sciweavers

1566 search results - page 156 / 314
» On a Cone Covering Problem
Sort
View
IROS
2008
IEEE
161views Robotics» more  IROS 2008»
15 years 11 months ago
A perception mechanism for supporting autonomous intersection handling in urban driving
Abstract— Knowledge of the driving environment is essential for robotic vehicles to comply with traffic rules while autonomously traversing intersections. However, due to limite...
Young-Woo Seo, Chris Urmson
APN
2007
Springer
15 years 10 months ago
Nets with Tokens Which Carry Data
Abstract. We study data nets, a generalisation of Petri nets in which tokens carry data from linearlyordered infinite domains and in which whole-place operations such as resets an...
Ranko Lazic, Thomas Christopher Newcomb, Joël...
148
Voted
FASE
2007
Springer
15 years 10 months ago
EQ-Mine: Predicting Short-Term Defects for Software Evolution
We use 63 features extracted from sources such as versioning and issue tracking systems to predict defects in short time frames of two months. Our multivariate approach covers aspe...
Jacek Ratzinger, Martin Pinzger, Harald Gall
GECCO
2007
Springer
191views Optimization» more  GECCO 2007»
15 years 10 months ago
One-test-at-a-time heuristic search for interaction test suites
Algorithms for the construction of software interaction test suites have focussed on the special case of pairwise coverage; less is known about efficiently constructing test suite...
Renée C. Bryce, Charles J. Colbourn
116
Voted
WADS
2007
Springer
98views Algorithms» more  WADS 2007»
15 years 10 months ago
Computing Best Coverage Path in the Presence of Obstacles in a Sensor Field
We study the presence of obstacles in computing BCP(s, t) (Best Coverage Path between two points s and t) in a 2D field under surveillance by sensors. Consider a set of m line seg...
Senjuti Basu Roy, Gautam Das, Sajal Das