Sciweavers

1429 search results - page 195 / 286
» The Complexity of the Approximation of the Bandwidth Problem
Sort
View
ICRA
2010
IEEE
90views Robotics» more  ICRA 2010»
13 years 6 months ago
Robust robotic assembly through contingencies, plan repair and re-planning
Abstract— Enabling mobile robots to assemble large structures in constrained environments requires planning systems that are both capable of dealing with high complexity and can ...
Frederik W. Heger, Sanjiv Singh
ICASSP
2011
IEEE
12 years 11 months ago
Cheap semidefinite relaxation MIMO detection using row-by-row block coordinate descent
This paper considers the problem of low complexity implementation of high-performance semidefinite relaxation (SDR) MIMO detection methods. Currently, most SDR MIMO detectors are...
Hoi-To Wai, Wing-Kin Ma, Anthony Man-Cho So
CSFW
2012
IEEE
11 years 10 months ago
Gran: Model Checking Grsecurity RBAC Policies
—Role-based Access Control (RBAC) is one of the most widespread security mechanisms in use today. Given the growing complexity of policy languages and access control systems, ver...
Michele Bugliesi, Stefano Calzavara, Riccardo Foca...
IPSN
2010
Springer
14 years 2 months ago
Online distributed sensor selection
A key problem in sensor networks is to decide which sensors to query when, in order to obtain the most useful information (e.g., for performing accurate prediction), subject to co...
Daniel Golovin, Matthew Faulkner, Andreas Krause
AINA
2005
IEEE
14 years 1 months ago
Dynamical Construction of a Core-Based Group-Shared Multicast Tree in Mobile Ad Hoc Networks
A core-based group-shared multicast tree is a shortest path tree rooted at core node that distributes packets to and from all group members. Traditionally, the bandwidth cost cons...
Bing-Hong Liu, Ming-Jer Tsai, Wei-Chei Ko