1576 search results - page 282 / 316 » Periodic Merging Networks |
156
click to vote
AGP
2010
IEEE
15 years 2 months ago
2010
IEEE
Constraint Logic Programming (CLP) is one of the most successful branches of Logic Programming; it attracts the interest of theoreticians and practitioners, and it is currently use...
ICRE
2000
IEEE
15 years 2 months ago
2000
IEEE
In this article we show the results of an extensive research on scenario evolution. We investigated twelve case studies spanning over 200 scenarios that contained over 800 episode...
SPAA
1997
ACM
15 years 1 months ago
1997
ACM
Pipelining has been used in the design of many PRAM algorithms to reduce their asymptotic running time. Paul, Vishkin, and Wagener (PVW) used the approach in a parallel implementat...
ACMICEC
2007
ACM
15 years 1 months ago
2007
ACM
The Internet and file sharing technology (such as P2P network) significantly alleviate the content distribution cost. However, better digital content distribution also means that ...
ANLP
1997
14 years 11 months ago
1997
This paper describes a new finite-state shallow parser. It merges constructive and reductionist approaches within a highly modular architecture. Syntactic information is added at ...