Sciweavers

630 search results - page 34 / 126
» Hardness results for approximating the bandwidth
Sort
View
106
Voted
FM
2006
Springer
146views Formal Methods» more  FM 2006»
15 years 4 months ago
Exact and Approximate Strategies for Symmetry Reduction in Model Checking
Symmetry reduction techniques can help to combat the state space explosion problem for model checking, but are restricted by the hard problem of determining equivalence of states d...
Alastair F. Donaldson, Alice Miller
77
Voted
SCAM
2006
IEEE
15 years 6 months ago
Characterising, Explaining, and Exploiting the Approximate Nature of Static Analysis through Animation
This paper addresses the question: “How can animated visualisation be used to express interesting properties of static analysis?” The particular focus is upon static dependenc...
David Binkley, Mark Harman, Jens Krinke
93
Voted
ECAI
2010
Springer
15 years 1 months ago
EP for Efficient Stochastic Control with Obstacles
Abstract. We address the problem of continuous stochastic optimal control in the presence of hard obstacles. Due to the non-smooth character of the obstacles, the traditional appro...
Thomas Mensink, Jakob J. Verbeek, Bert Kappen
125
Voted
AINA
2005
IEEE
15 years 6 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
ICASSP
2011
IEEE
14 years 4 months ago
Polynomial expansion detector for uniform linear arrays
In this paper, we design a low complexity linear MMSE decoder to recover the signal transmitted by M mobile users to a base station equipped with N receiving antennas, arranged as...
Antonia Maria Masucci, Øyvind Ryan, M&eacut...