Sciweavers

3825 search results - page 306 / 765
» The Language of Time: A Reader
Sort
View
ICALP
1992
Springer
15 years 10 months ago
Fast Integer Merging on the EREW PRAM
Abstract. We investigate the complexity of merging sequences of small integers on the EREW PRAM. Our most surprising result is that two sorted sequences of n bits each can be merge...
Torben Hagerup
221
Voted
IWEB
1998
15 years 8 months ago
Using Java for the Coordination of Workflows in the World Wide Web
In this paper we introduce a workflow management system, called WebFlow, which is based on the world wide web and Java as its basic technologies. Java is used as the build time (m...
Michael Weber, Torsten Illmann
IR
2008
15 years 6 months ago
A compressed self-index using a Ziv-Lempel dictionary
A compressed full-text self-index for a text T , of size u, is a data structure used to search for patterns P, of size m, in T , that requires reduced space, i.e. space that depend...
Luís M. S. Russo, Arlindo L. Oliveira
JSS
2006
99views more  JSS 2006»
15 years 6 months ago
A tunable hybrid memory allocator
Dynamic memory management can make up to 60% of total program execution time. Object oriented languages such as C++ can use 20 times more memory than procedural languages like C. ...
Yusuf Hasan, J. Morris Chang
JAIR
1998
81views more  JAIR 1998»
15 years 6 months ago
Computational Aspects of Reordering Plans
This article studies the problem of modifying the action ordering of a plan in order to optimise the plan according to various criteria. One of these criteria is to make a plan le...
Christer Bäckström