15485 search results - page 639 / 3097 » Computing Optimal Subsets |
190
click to vote
MFCS
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. We prove that the class of context-free languages with polynomially bounded ambiguity (PCFL) is the closure of the class of unambiguous languages (UCFL) under projections...
210
click to vote
ICPPW
1999
IEEE
15 years 11 months ago
1999
IEEE
Using MPI to work with composed data-types, or datatypes using pointers, is not a built-in operation. AutoMap and AutoLink are two tools that provide those functionalities to the ...
159
click to vote
IPPS
1999
IEEE
15 years 11 months ago
1999
IEEE
The Paderborn University BSP (PUB) library is a parallel C library based on the BSP model. The basic library supports buffered and unbuffered asynchronous communication between an...
180
click to vote
ERSHOV
1999
Springer
15 years 11 months ago
1999
Springer
Abstract. Existing partial evaluators usually fix the strategy for binding-time analysis. But a single strategy cannot fulfill all goals without leading to compromises regarding ...
204
click to vote
ICSE
1998
IEEE-ACM
15 years 11 months ago
1998
IEEE-ACM
Program slicing, a technique to compute the subset of program statements that can affect the value of a program variable at a specific program point, is widely used in tools to su...