Sciweavers

1220 search results - page 150 / 244
» Restricting grammatical complexity
Sort
View
HICSS
2009
IEEE
114views Biometrics» more  HICSS 2009»
14 years 2 months ago
Reexamining Threat Rigidity: Implications for Design
Emergencies today seem larger, more complex, and unique than those of the past. Responding to them requires flexibility and creativity not easily achieved. The threat-rigidity the...
Linda Plotnick, Murray Turoff, Gerd Van Den Eede
LATA
2009
Springer
14 years 2 months ago
Membership Testing: Removing Extra Stacks from Multi-stack Pushdown Automata
We show that fixed membership testing for many interesting subclasses of multi-pushdown machines is no harder than for pushdowns with single stack. The models we consider are MVPA...
Nutan Limaye, Meena Mahajan
COMPSAC
2009
IEEE
14 years 2 months ago
System Safety Requirements as Control Structures
Along with the popularity of software-intensive systems, the interactions between system components and between humans and software applications are becoming more and more complex...
Zhe Chen, Gilles Motet
DATE
2009
IEEE
118views Hardware» more  DATE 2009»
14 years 2 months ago
Limiting the number of dirty cache lines
Abstract—Caches often employ write-back instead of writethrough, since write-back avoids unnecessary transfers for multiple writes to the same block. For several reasons, however...
Pepijn J. de Langen, Ben H. H. Juurlink
FOCS
2009
IEEE
14 years 2 months ago
A Complete Characterization of Statistical Query Learning with Applications to Evolvability
Statistical query (SQ) learning model of Kearns is a natural restriction of the PAC learning model in which a learning algorithm is allowed to obtain estimates of statistical prop...
Vitaly Feldman