Sciweavers

2489 search results - page 235 / 498
» On the Subgroup Distance Problem
Sort
View
WER
2005
Springer
15 years 10 months ago
Towards a Cognitive-Based Approach to Distributed Requirement Elicitation Processes
Distance between stakeholders working on a global software development project introduces problems in communication and control. Processes like requirements elicitation, where comm...
Gabriela N. Aranda, Aurora Vizcaíno, Alejan...
IBERAMIA
2004
Springer
15 years 10 months ago
A Multi-robot Strategy for Rapidly Searching a Polygonal Environment
In this paper we address the problem of finding an object in a polygonal environment as quickly as possible on average, with a team of mobile robots that can sense the environment...
Alejandro Sarmiento, Rafael Murrieta-Cid, Seth Hut...
110
Voted
ISAAC
2004
Springer
79views Algorithms» more  ISAAC 2004»
15 years 10 months ago
Paired Pointset Traversal
In the Paired Pointset Traversal problem we ask whether, given two sets A = {a1, . . . , an} and B = {b1, . . . , bn} in the plane, there is an ordering π of the points such that ...
Peter Hui, Marcus Schaefer
ICRA
2000
IEEE
86views Robotics» more  ICRA 2000»
15 years 9 months ago
Randomized Planning for Short Inspection Paths
This paper addresses the following inspection problem: given a known workspace and a robot with vision capabilities compute a short path path for the robot such that each point on...
Tim Danner, Lydia E. Kavraki
IPPS
1998
IEEE
15 years 9 months ago
A Scalable VLSI Architecture for Binary Prefix Sums
The task of computingbinary prefix sums (BPS, for short) arises, for example, in expression evaluation, data and storage compaction, and routing. This paper describes a scalable V...
Rong Lin, Koji Nakano, Stephan Olariu, Maria Crist...