1452 search results - page 253 / 291 » Algorithmic Analysis of Array-Accessing Programs |
151
click to vote
ATAL
2006
Springer
15 years 8 months ago
2006
Springer
We investigate the computational complexity of reasoning about multi-agent systems using the cooperation logic ATL of Alur, Henzinger, and Kupferman. It is known that satisfiabili...
142
Voted
CMSB
2006
Springer
15 years 8 months ago
2006
Springer
Type checking and type inference are important concepts and methods of programming languages and software engineering. Type checking is a way to ensure some level of consistency, d...
157
click to vote
ASPLOS
2008
ACM
15 years 6 months ago
2008
ACM
Parallel and concurrent garbage collectors are increasingly employed by managed runtime environments (MREs) to maintain scalability, as multi-core architectures and multi-threaded...
183
click to vote
HIPEAC
2011
Springer
14 years 4 months ago
2011
Springer
Dynamic typing is a barrier for JavaScript applications to achieve high performance. Compared with statically typed languages, the major overhead of dynamic typing comes from runt...
138
click to vote
MOBIHOC
2009
ACM
16 years 5 months ago
2009
ACM
Distributed scheduling algorithms for wireless ad hoc networks have received substantial attention over the last decade. The complexity levels of these algorithms span a wide spec...