1089 search results - page 135 / 218 » Bounds on generalized Frobenius numbers |
FOSAD
2009
Springer
14 years 3 months ago
2009
Springer
We introduce the Open-source Fixed-point Model Checker OFMC for symbolic security protocol analysis, which extends the Onthe-fly Model Checker (the previous OFMC). The native inpu...
ICASSP
2008
IEEE
14 years 3 months ago
2008
IEEE
—We aim to characterize the maximum link throughput of a multi-channel opportunistic communication system. The states of these channels evolve as independent and identically dist...
ICDCS
2008
IEEE
14 years 3 months ago
2008
IEEE
— Connected dominating set (CDS) has a wide range of applications in wireless ad hoc networks. A number of distributed algorithms for constructing a small CDS in wireless ad hoc ...
CSR
2007
Springer
14 years 3 months ago
2007
Springer
The maximum constraint satisfaction problem (Max CSP) is the following computational problem: an instance is a finite collection of constraints on a set of variables, and the goal...
ESA
2007
Springer
14 years 3 months ago
2007
Springer
We study the online ad-auctions problem introduced by Mehta et. al. [15]. We design a (1 − 1/e)competitive (optimal) algorithm for the problem, which is based on a clean primal-...