725 search results - page 134 / 145 » Complexity of Computing with Extended Propositional Logic Pr... |
129
click to vote
DAC
1997
ACM
15 years 6 months ago
1997
ACM
This paper examines the problem of statically analyzing the performance of embedded software. This problem is motivated by the increasing growth of embedded systems and a lack of ...
136
click to vote
SIGMOD
1996
ACM
15 years 6 months ago
1996
ACM
While much recent research has focussed on extending databases beyond the traditional relational model, relatively little has been done to develop database tools for querying data...
131
click to vote
ALGORITHMICA
2005
15 years 2 months ago
2005
We present a new bit-parallel technique for approximate string matching. We build on two previous techniques. The first one, BPM [Myers, J. of the ACM, 1999], searches for a patte...
231
Voted
POPL
2009
ACM
16 years 3 months ago
2009
ACM
Transactional memory (TM) is a promising paradigm for concurrent programming. Whereas the number of TM implementations is growing, however, little research has been conducted to p...
111
click to vote
FOSSACS
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. The reachability analysis of recursive programs that communicate asynchronously over reliable Fifo channels calls for restrictions to ensure decidability. We extend here ...