Sciweavers

494 search results - page 57 / 99
» Heap Building Bounds
Sort
View
CORR
2010
Springer
132views Education» more  CORR 2010»
15 years 3 months ago
Performance of Interference Alignment in Clustered Wireless Ad Hoc Networks
Abstract--Spatial interference alignment among a finite number of users is investigated as a technique to increase the probability of successful transmission in an interference lim...
Roland Tresch, Maxime Guillaud
ECCC
2010
92views more  ECCC 2010»
15 years 2 months ago
Logspace Versions of the Theorems of Bodlaender and Courcelle
Bodlaender’s Theorem states that for every k there is a linear-time algorithm that decides whether an input graph has tree width k and, if so, computes a width-k tree compositio...
Michael Elberfeld, Andreas Jakoby, Till Tantau
CDC
2010
IEEE
152views Control Systems» more  CDC 2010»
14 years 10 months ago
Completely decentralised navigation of multiple unicycle agents with prioritisation and fault tolerance
Abstract-- We propose an algorithm for decentralised navigation of multiple independent agents, applicable to Robotics and Air Traffic Control (ATC). We present completely decentra...
Giannis P. Roussos, Kostas J. Kyriakopoulos
ANOR
2010
112views more  ANOR 2010»
15 years 3 months ago
The Multi-Story Space Assignment Problem
-- The Multi-Story Space Assignment Problem (MSAP) is an innovative formulation of the multi-story facility assignment problem that allows one to model the location of departments ...
Peter M. Hahn, J. MacGregor Smith, Yi-Rong Zhu
CONSTRAINTS
2007
100views more  CONSTRAINTS 2007»
15 years 3 months ago
Design of Financial CDO Squared Transactions Using Constraint Programming
We give an approximate and often extremely fast method of building a particular kind of portfolio in finance, here called a portfolio design (PD), with applications in the credit ...
Pierre Flener, Justin Pearson, Luis G. Reyna, Olof...