Sciweavers

3341 search results - page 482 / 669
» On Bounded Queries and Approximation
Sort
View
MFCS
2007
Springer
16 years 20 days ago
On the Complexity of Computing Treelength
We resolve the computational complexity of determining the treelength of a graph, thereby solving an open problem of Dourisboure and Gavoille, who introduced this parameter, and a...
Daniel Lokshtanov
SOFSEM
2007
Springer
16 years 19 days ago
Algorithmic Aspects of Minimum Energy Edge-Disjoint Paths in Wireless Networks
The problem of finding k minimum energy, edge-disjoint paths in wireless networks (MEEP) arises in the context of routing and belongs to the class of range assignment problems. A ...
Markus Maier, Steffen Mecke, Dorothea Wagner
ICRA
2006
IEEE
217views Robotics» more  ICRA 2006»
16 years 17 days ago
Complete Coverage Control for Nonholonomic Mobile Robots in Dynamic Environments
— We study the problem of generating continuous steering control for robots to completely cover a bounded region over a finite time. First, we pack the area by disks of minimum ...
Yi Guo, Mohanakrishnan Balakrishnan
RTCSA
2006
IEEE
16 years 16 days ago
Characterization and Analysis of Tasks with Offsets: Monotonic Transactions
This article introduces the concept of monotonic transactions. A monotonic transaction is a particular case of transactions for which the load arrival pattern is (or can be by rot...
Karim Traore, Emmanuel Grolleau, Francis Cottet
VTC
2006
IEEE
118views Communications» more  VTC 2006»
16 years 16 days ago
Demodulation and Performance Analysis of Differential Unitary Space-Time Modulation in Time-Varying Rician Channels
Abstract— Studies on differential unitary space-time modulation are mostly focused on Rayleigh fading channels. In this paper we present new analytic results for the maximum-like...
Haichang Sui, James R. Zeidler