131 search results - page 8 / 27 » The Complexity of Online Memory Checking |
IPPS
2008
IEEE
15 years 3 months ago
2008
IEEE
Transactional memory systems promise to reduce the burden of exposing thread-level parallelism in programs by relieving programmers from analyzing complex inter-thread dependences...
157
click to vote
POPL
2003
ACM
15 years 9 months ago
2003
ACM
Given a program and two variables p and q, the goal of points-to analysis is to check if p can point to q in some execution of the program. This well-studied problem plays a cruci...
AIPS
2009
14 years 10 months ago
2009
We propose an online algorithm for planning under uncertainty in multi-agent settings modeled as DEC-POMDPs. The algorithm helps overcome the high computational complexity of solv...
EMNLP
2007
14 years 11 months ago
2007
Deterministic parsing has emerged as an effective alternative for complex parsing algorithms which search the entire search space to get the best probable parse tree. In this pape...
RSP
2007
IEEE
15 years 3 months ago
2007
IEEE
Designing security softwares that evolve as quickly as threats is a truthful challenge. In addition, current software becomes increasingly more complex and difficult to handle ev...