4110 search results - page 350 / 822 » Efficient algorithms for the 2-gathering problem |
162
click to vote
WCRE
1999
IEEE
15 years 11 months ago
1999
IEEE
The software clustering problem has attracted much attention recently, since it is an integral part of the process of reverse engineering large software systems. A key problem in ...
183
click to vote
IWANN
1997
Springer
15 years 11 months ago
1997
Springer
: The path planning problem is relevant for all applications in which a mobil robot should autonomously navigate. Finding the shortest path in an environment that is only partialy ...
177
Voted
ICALP
1990
Springer
15 years 10 months ago
1990
Springer
We show how (now familiar) hierarchical representations of (convex) polyhedra can be used to answer various separation queries efficiently (in a number of cases, optimally). Our e...
168
click to vote
DSD
2004
IEEE
15 years 10 months ago
2004
IEEE
This paper describes principles of a novel two-level multi-output Boolean minimizer FC-Min, namely its Find Coverage phase. The problem of Boolean minimization is approached in a ...
148
click to vote
ECAI
2006
Springer
15 years 10 months ago
2006
Springer
Computer Supported Cooperative Work (CSCW) defines software tools and technology to support groups of people working together on a project, often at different sites [5]. In this wo...