3044 search results - page 303 / 609 » Linear logical approximations |
218
click to vote
SPAA
1999
ACM
15 years 11 months ago
1999
ACM
The time-constrained packet routing problem is to schedule a set of packets to be transmitted through a multinode network, where every packet has a source and a destination (as in ...
188
Voted
CORR
2007
Springer
15 years 6 months ago
2007
Springer
Many data analysis applications deal with large matrices and involve approximating the matrix using a small number of “components.” Typically, these components are linear combi...
172
click to vote
ICCAD
1993
IEEE
15 years 11 months ago
1993
IEEE
Current approaches to compute and exploit the flexibility of a component in an FSM network are all at the symbolic level [23, 30, 33, 31]. Conventionally, exploitation of this ...
188
click to vote
WWW
2007
ACM
16 years 7 months ago
2007
ACM
The ability to extract meaningful fragments from an ontology is key for ontology re-use. We propose a definition of a module that guarantees to completely capture the meaning of a...
198
click to vote
NJC
2000
15 years 6 months ago
2000
We show how linear typing can be used to obtain functional programs which modify heap-allocated data structures in place. We present this both as a "design pattern" for ...