Sciweavers

982 search results - page 82 / 197
» Solving Steiner tree problems in graphs to optimality
Sort
View
IJRR
2006
116views more  IJRR 2006»
14 years 10 months ago
The Graph SLAM Algorithm with Applications to Large-Scale Mapping of Urban Structures
This article presents GraphSLAM, a unifying algorithm for the offline SLAM problem. GraphSLAM is closely related to a recent sequence of research papers on applying optimization t...
Sebastian Thrun, Michael Montemerlo
IJES
2006
72views more  IJES 2006»
14 years 10 months ago
Non-contiguous linear placement for reconfigurable fabrics
: We present efficient solutions for the non-contiguous linear placement of data-paths for reconfigurable fabrics. A strip-based architecture is assumed for the reconfigurable fabr...
Cristinel Ababei, Kia Bazargan
JAL
2006
101views more  JAL 2006»
14 years 10 months ago
Semi-matchings for bipartite graphs and load balancing
We consider the problem of fairly matching the left-hand vertices of a bipartite graph to the right-hand vertices. We refer to this problem as the optimal semimatching problem; it...
Nicholas J. A. Harvey, Richard E. Ladner, Lá...
APVIS
2006
14 years 11 months ago
Interactive optimization in cooperative environments
In the present paper, we introduce a multi-user interactive framework for solving complex optimization problems. The framework, called Co-UserHints, provides a visual computationa...
Joelma de Moura Ferreira, Hugo A. D. do Nascimento...
INFOCOM
2008
IEEE
15 years 4 months ago
Multicast Tree Diameter for Dynamic Distributed Interactive Applications
Abstract—Latency reduction in distributed interactive applications has been studied intensively. Such applications may have stringent latency requirements and dynamic user groups...
Knut-Helge Vik, Pål Halvorsen, Carsten Griwo...