4266 search results - page 343 / 854 » Search for More Declarativity |
189
click to vote
OOPSLA
1997
Springer
15 years 11 months ago
1997
Springer
Object relationships in modern software systems are becoming increasingly numerous and complex. Programmers who try to find violations of such relationships need new tools that al...
238
click to vote
CRYPTO
2007
Springer
15 years 10 months ago
2007
Springer
We present as-strong-as-possible definitions of privacy, and constructions achieving them, for public-key encryption schemes where the encryption algorithm is deterministic. We ob...
176
Voted
ILP
2000
Springer
15 years 10 months ago
2000
Springer
Induction of recursive theories in the normal ILP setting is a complex task because of the non-monotonicity of the consistency property. In this paper we propose computational solu...
183
Voted
PATAT
1995
Springer
15 years 10 months ago
1995
Springer
The scheduling of exams in institutions of higher education is known to be a highly constrained problem. The advent of modularity in many institutions in the UK has resulted in a s...
139
Voted
AAAI
2007
15 years 9 months ago
2007
Local search is widely applied to satisfiable SAT problems, and on some problem classes outperforms backtrack search. An intriguing challenge posed by Selman, Kautz and McAlleste...