3713 search results - page 700 / 743 » Constructing a Calculus of Programs |
177
click to vote
ERLANG
2003
ACM
15 years 11 months ago
2003
ACM
The viability of implementing an in-memory database, Erlang ETS, using a relatively-new data structure, called a Judy array, was studied by comparing the performance of ETS tables...
126
click to vote
COCO
2003
Springer
15 years 11 months ago
2003
Springer
We continue an investigation of resource-bounded Kolmogorov complexity and derandomization techniques begun in [2, 3]. We introduce nondeterministic time-bounded Kolmogorov comple...
159
click to vote
AINA
2010
IEEE
15 years 11 months ago
2010
IEEE
Cloud computing is an emerging technology that allows users to utilize on-demand computation, storage, data and services from around the world. However, Cloud service providers ch...
163
click to vote
ICALP
2010
Springer
15 years 10 months ago
2010
Springer
Computing a minimum vertex cover in graphs and hypergraphs is a well-studied optimizaton problem. While intractable in general, it is well known that on bipartite graphs, vertex c...
173
click to vote
REFLECTION
2001
Springer
15 years 10 months ago
2001
Springer
, are to address what we perceive as the most pressing shortcomings of current reflective middleware platforms. First, performance: in the worst case, this needs to be on a par wit...