9443 search results - page 1534 / 1889 » Web-centric language models |
169
click to vote
CP
2005
Springer
16 years 9 days ago
2005
Springer
Many problems of theoretical and practical interest can be formulated as Constraint Satisfaction Problems (CSPs). The general CSP is known to be NP-complete; however, distributed m...
186
click to vote
CP
2005
Springer
16 years 9 days ago
2005
Springer
Abstract. Constraint Programming is a proven successful technique, but it requires skill in modeling problems, and knowledge on how algorithms interact with models. What can be a g...
182
click to vote
CRYPTO
2005
Springer
16 years 9 days ago
2005
Springer
In this paper, we continue the study the round complexity of black-box zero knowledge in the bare public-key (BPK, for short) model previously started by Micali and Reyzin in [11]....
187
click to vote
FOSSACS
2005
Springer
16 years 9 days ago
2005
Springer
Separation logic is a spatial logic for reasoning locally about heap structures. A decidable fragment of its assertion language was presented in [1], based on a bounded model prope...
151
click to vote
ICALP
2005
Springer
16 years 8 days ago
2005
Springer
We define an algorithmic paradigm, the stack model, that captures many primal-dual and local-ratio algorithms for approximating covering and packing problems. The stack model is ...