1105 search results - page 139 / 221 » Linear choosability of graphs |
107
click to vote
ICRA
2003
IEEE
15 years 10 months ago
2003
IEEE
This paper presents an algorithm, called PCG, for planning the foothold positions of spider-like robots in planar tunnels bounded by piecewise linear walls. The paper focuses on 3-...
179
click to vote
ISPAN
2002
IEEE
15 years 9 months ago
2002
IEEE
In the directed acyclic graph (dag) model of algorithms, consider the following problem for precedence-constrained multiprocessor schedules for array computations: Given a sequenc...
112
click to vote
ICCD
2000
IEEE
16 years 1 months ago
2000
IEEE
This paper presents a very general, exact technique for scheduling looping data-flow graphs. In contrast to the conventional technique using loop iteration variables and integer ...
123
click to vote
ICC
2007
IEEE
15 years 11 months ago
2007
IEEE
— In this paper, a low-complexity high-performance detection algorithm for multiple input multiple output (MIMO) channels with severe delay spread is proposed. This algorithm per...
128
click to vote
ICNP
2007
IEEE
15 years 11 months ago
2007
IEEE
- A Network Court Protocol is designed for malicious node conviction based on information from network node accusing and testifying operations, which are formally modeled by algebr...