831 search results - page 129 / 167 » Coalgebraic Correspondence Theory |
119
click to vote
CP
2011
Springer
13 years 11 months ago
2011
Springer
A depth-first search algorithm can be used to find optimal solutions of a Constraint Satisfaction Problem (CSP) with respect to a set of conditional preferences statements (e.g.,...
210
click to vote
IACR
2011
13 years 11 months ago
2011
We analyze the multivariate generalization of Howgrave-Graham’s algorithm for the approximate common divisor problem. In the m-variable case with modulus N and approximate common...
102
click to vote
ICC
2011
IEEE
13 years 11 months ago
2011
IEEE
—In this paper, recent results in game theory and stochastic approximation are brought together to mitigate the problem of femto-to-macrocell cross-tier interference. The main re...
194
click to vote
POPL
2008
ACM
16 years 4 days ago
2008
ACM
We propose a novel approach to proving the termination of heapmanipulating programs, which combines separation logic with cyclic proof within a Hoare-style proof system. Judgement...
STOC
2007
ACM
16 years 3 days ago
2007
ACM
We demonstrate an average-case problem that is as hard as finding (n)-approximate shortest vectors in certain n-dimensional lattices in the worst case, where (n) = O( log n). The...