3653 search results - page 271 / 731 » On Recognizable Timed Languages |
180
click to vote
PLDI
2000
ACM
15 years 11 months ago
2000
ACM
{ This paper presents a new approach to local instruction scheduling based on integer programming that produces optimal instruction schedules in a reasonable time, even for very la...
197
click to vote
TIME
1994
IEEE
15 years 11 months ago
1994
IEEE
We describe a discrete time probabilitylogic for use as the representation language of a temporal knowledge base. In addition to the usual expressive power of a discrete temporal ...
183
click to vote
ICALP
1992
Springer
15 years 11 months ago
1992
Springer
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...
242
click to vote
IWEB
1998
15 years 8 months ago
1998
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...
209
click to vote
IR
2008
15 years 7 months ago
2008
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...