Sciweavers

828 search results - page 138 / 166
» Bounded Hairpin Completion
Sort
View
POPL
2005
ACM
14 years 10 months ago
Precise interprocedural analysis using random interpretation
We describe a unified framework for random interpretation that generalizes previous randomized intraprocedural analyses, and also extends naturally to efficient interprocedural an...
Sumit Gulwani, George C. Necula
STOC
2003
ACM
90views Algorithms» more  STOC 2003»
14 years 10 months ago
Work-competitive scheduling for cooperative computing with dynamic groups
The problem of cooperatively performing a set of t tasks in a decentralized setting where the computing medium is subject to failures is one of the fundamental problems in distrib...
Chryssis Georgiou, Alexander Russell, Alexander A....
ALT
2005
Springer
14 years 6 months ago
Learning Multiple Languages in Groups
We consider a variant of Gold’s learning paradigm where a learner receives as input n different languages (in form of one text where all input languages are interleaved). Our g...
Sanjay Jain, Efim B. Kinber
DSD
2009
IEEE
144views Hardware» more  DSD 2009»
14 years 4 months ago
Composable Resource Sharing Based on Latency-Rate Servers
Abstract—Verification of application requirements is becoming a bottleneck in system-on-chip design, as the number of applications grows. Traditionally, the verification comple...
Benny Akesson, Andreas Hansson, Kees Goossens
GLOBECOM
2009
IEEE
14 years 4 months ago
Random Linear Network Coding for Time-Division Duplexing: Field Size Considerations
Abstract— We study the effect of the field size on the performance of random linear network coding for time division duplexing channels proposed in [1]. In particular, we study ...
Daniel Enrique Lucani, Muriel Médard, Milic...