Sciweavers

677 search results - page 15 / 136
» Reducing the Space Requirement of LZ-Index
Sort
View
FMSD
2006
59views more  FMSD 2006»
14 years 9 months ago
Optimistic synchronization-based state-space reduction
Reductions that aggregate fine-grained transitions into coarser transitions can significantly reduce the cost of automated verification, by reducing the size of the state space. W...
Scott D. Stoller, Ernie Cohen
DATE
2005
IEEE
155views Hardware» more  DATE 2005»
15 years 3 months ago
Studying Storage-Recomputation Tradeoffs in Memory-Constrained Embedded Processing
Fueled by an unprecedented desire for convenience and self-service, consumers are embracing embedded technology solutions that enhance their mobile lifestyles. Consequently, we wi...
Mahmut T. Kandemir, Feihui Li, Guilin Chen, Guangy...
76
Voted
PASTE
2010
ACM
14 years 11 months ago
Packrat parsers can handle practical grammars in mostly constant space
Packrat parsing is a powerful parsing algorithm presented by Ford in 2002. Packrat parsers can handle complicated grammars and recursive structures in lexical elements more easily...
Kota Mizushima, Atusi Maeda, Yoshinori Yamaguchi
PDPTA
2008
14 years 11 months ago
Predicting Web Cache Behavior using Stochastic State-Space Models
Web caches play an important role in improving the surfing experience of Web clients and reducing the network traffic seen by Web servers. Accurate analytical models of Web caches ...
Amitayu Das, Ritendra Datta, Bhuvan Urgaonkar, Ana...
AAAI
2012
13 years 2 days ago
Planning in Factored Action Spaces with Symbolic Dynamic Programming
We consider symbolic dynamic programming (SDP) for solving Markov Decision Processes (MDP) with factored state and action spaces, where both states and actions are described by se...
Aswin Raghavan, Saket Joshi, Alan Fern, Prasad Tad...