1204 search results - page 117 / 241 » Termination of Polynomial Programs |
105
click to vote
ICLP
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. In recent work, a general framework for specifying program correspondences under the answer-set semantics has been defined. The framework allows to define different not...
140
click to vote
ICCAD
2010
IEEE
14 years 10 months ago
2010
IEEE
Clock mesh is popular in high performance VLSI design because it is more robust against variations than clock tree at a cost of higher power consumption. In this paper, we propose ...
118
Voted
POPL
2000
ACM
15 years 4 months ago
2000
ACM
Systems that authenticate a user based on a shared secret (such as a password or PIN) normally allow anyone to query whether the secret is a given value. For example, an ATM machi...
110
click to vote
DAGSTUHL
2006
15 years 2 months ago
2006
We consider the computational complexity of producing the best possible offspring in a crossover, given two solutions of the parents. The crossover operators are studied on the cla...
118
Voted
JSAT
2006
15 years 21 days ago
2006
Semidefinite optimization, commonly referred to as semidefinite programming, has been a remarkably active area of research in optimization during the last decade. For combinatoria...