208 search results - page 28 / 42 » Improved upper bounds on the crossing number |
SPAA
1995
ACM
13 years 11 months ago
1995
ACM
We study the problem of sorting on a parallel computer with limited communication bandwidth. By using the PRAM(m) model, where p processors communicate through a globally shared me...
MST
2011
13 years 2 months ago
2011
We study the impact of collusion in network games with splittable flow and focus on the well established price of anarchy as a measure of this impact. We first investigate symmet...
GC
2008
Springer
13 years 7 months ago
2008
Springer
We prove that for graphs of order n, minimum degree 2 and girth g 5 the domination number satisfies 1 3 + 2 3g n. As a corollary this implies that for cubic graphs of order n ...
ICTCS
2005
Springer
14 years 27 days ago
2005
Springer
We consider the fundamental problem of waking up n processors sharing a multiple access channel. We assume the weakest model of synchronization, the locally synchronous model, in ...
AROBOTS
2004
2004
Propagation of Uncertainty in Cooperative Multirobot Localization: Analysis and Experimental Results
13 years 7 months ago
This paper examines the problem of cooperative localization for the case of large groups of mobile robots. A Kalman filter estimator is implemented and tested for this purpose. The...