1220 search results - page 138 / 244 » Restricting grammatical complexity |
PODC
2004
ACM
14 years 1 months ago
2004
ACM
The Border Gateway Protocol (BGP) for interdomain routing is designed to allow autonomous systems (ASes) to express policy preferences over alternative routes. We model these pref...
SELMAS
2004
Springer
14 years 1 months ago
2004
Springer
The development of Multi-Agent Systems (MASs) involves special concerns, such as interaction, adaptation, autonomy, among others. Many of these concerns are overlapping, crosscut e...
STOC
1994
ACM
13 years 12 months ago
1994
ACM
We present new results on the well-studied problem of learning DNF expressions. We prove that an algorithm due to Kushilevitz and Mansour [13] can be used to weakly learn DNF form...
COCO
2010
Springer
13 years 11 months ago
2010
Springer
The last decade has seen a revival of interest in pebble games in the context of proof complexity. Pebbling has proven to be a useful tool for studying resolution-based proof syst...
SOUPS
2010
ACM
13 years 11 months ago
2010
ACM
We examine the password policies of 75 different websites. Our goal is understand the enormous diversity of requirements: some will accept simple six-character passwords, while o...