106 search results - page 14 / 22 » Proving Lower Bounds Via Pseudo-random Generators |
MOR
2006
13 years 7 months ago
2006
We consider repeated games in which the player, instead of observing the action chosen by the opponent in each game round, receives a feedback generated by the combined choice of ...
INFOCOM
2003
IEEE
14 years 23 days ago
2003
IEEE
— Input-queued switches are used extensively in the design of high-speed routers. As switch speeds and sizes increase, the design of the switch scheduler becomes a primary challe...
ICALP
2005
Springer
14 years 1 months ago
2005
Springer
We consider the problem of testing the commutativity of a black-box group specified by its k generators. The complexity (in terms of k) of this problem was first considered by Pa...
APIN
1998
13 years 7 months ago
1998
Incidence calculus is a probabilistic logic in which incidences, standing for the situations in which formulae may be true, are assigned to some formulae, and probabilities are as...
CN
2007
13 years 7 months ago
2007
As next-generation computer worms may spread within minutes to millions of hosts, protection via human intervention is no longer an option. We discuss the implementation of SweetB...