1686 search results - page 176 / 338 » Programs as polygraphs: computability and complexity |
121
Voted
PLDI
1998
ACM
15 years 7 months ago
1998
ACM
Achieving good performance in bytecoded language interpreters is di cult without sacri cing both simplicity and portability. This is due to the complexity of dynamic translation (...
152
click to vote
CAISE
1995
Springer
15 years 7 months ago
1995
Springer
In this work we discuss a number of issues for the design of hypertext systems in an actor-based model of computation. We examine how the "traditional" basic concepts whi...
120
Voted
DLOG
2007
15 years 6 months ago
2007
Abstract. To make ABox reasoning scalable for large ABoxes in description logic (DL) knowledge bases, we develop a method for partitioning the ABox so that specific kinds of reaso...
126
Voted
MOR
2006
15 years 3 months ago
2006
In multicriteria optimization, several objective functions, conflicting with each other, have to be minimized simultaneously. We propose a new efficient method for approximating t...
118
click to vote
STOC
2005
ACM
16 years 4 months ago
2005
ACM
We consider the problem of approximately counting integral flows in a network. We show that there is an fpras based on volume estimation if all capacities are sufficiently large, ...