1871 search results - page 25 / 375 » The Ephemeral Pairing Problem |
108
click to vote
FECS
2006
15 years 14 days ago
2006
- Developments in CS1 pedagogy seek to improve the capabilities of students in their understanding of how to write programs. This involves learning how to solve various types of pr...
137
click to vote
LPAR
2004
Springer
15 years 4 months ago
2004
Springer
The dependency pair approach is one of the most powerful techniques for automated termination proofs of term rewrite systems. Up to now, it was regarded as one of several possible ...
104
click to vote
DATE
2000
IEEE
15 years 3 months ago
2000
IEEE
In [1], Murata et al introduced an elegant representation of block placement called sequence pair. All block placement algorithms which are based on sequence pairs use simulated a...
104
click to vote
GECCO
2008
Springer
15 years 4 days ago
2008
Springer
Pair approximations have often been used to predict equilibrium conditions in spatially-explicit epidemiological and ecological systems. In this work, we investigate whether this ...
129
click to vote
IMA
2005
Springer
15 years 4 months ago
2005
Springer
In recent years cryptographic protocols based on the Weil and Tate pairings on elliptic curves have attracted much attention. A notable success in this area was the elegant solutio...