4066 search results - page 351 / 814 » Almost Complete Sets |
172
click to vote
GPCE
2005
Springer
16 years 8 days ago
2005
Springer
Abstract. The past decade of experience has demonstrated that the generic programming methodology is highly effective for the design, implementation, and use of large-scale softwar...
152
click to vote
SIGIR
2004
ACM
16 years 5 days ago
2004
ACM
This paper examines whether the Cranfield evaluation methodology is robust to gross violations of the completeness assumption (i.e., the assumption that all relevant documents wi...
169
click to vote
GD
2004
Springer
16 years 4 days ago
2004
Springer
The no-three-in-line problem, introduced by Dudeney in 1917, asks for the maximum number of points in the n × n grid with no three points collinear. In 1951, Erd¨os proved that t...
167
click to vote
IWPEC
2004
Springer
16 years 3 days ago
2004
Springer
Consider the following problem, that we call “Chordless Path through Three Vertices” or CP3V, for short: Given a simple undirected graph G = (V, E), a positive integer k, and t...
178
click to vote
JELIA
2004
Springer
16 years 3 days ago
2004
Springer
In this work we reconsider the replacement of predicate-like notation by functional terms, using a similar syntax to Functional Logic Programming, but under a completely different...