1089 search results - page 49 / 218 » Bounds on generalized Frobenius numbers |
PODC
1993
ACM
13 years 11 months ago
1993
ACM
A counting protocol (mod m) consists of shared memory bits - referred to as the counter - and of a procedure for incrementing the counter value by 1 (mod m). The procedure may be ...
AIPS
2006
13 years 9 months ago
2006
We study the consequences on complexity that arise when bounds on the number of branch points on the solutions for non-deterministic planning problems are imposed as well as when ...
ALGORITHMICA
2010
13 years 7 months ago
2010
Given a cellular (mobile telephone) network, whose geographical coverage area is divided into hexagonal cells, phone calls are serviced by assigning frequencies to them so that no...
ALT
2004
Springer
14 years 4 months ago
2004
Springer
We consider a two-layer network algorithm. The first layer consists of an uncountable number of linear units. Each linear unit is an LMS algorithm whose inputs are first “kerne...
ICASSP
2008
IEEE
14 years 2 months ago
2008
IEEE
This paper derives the Cramer-Rao lower bound (CRLB) on estimates of the frequency of a coherent pulse-train passively intercepted at a moving antenna. Such estimates are used to ...