893 search results - page 134 / 179 » P3C: A New Algorithm for the Simple Temporal Problem |
STOC
2001
ACM
14 years 9 months ago
2001
ACM
Optimal program slicing determines for a statement S in a program whether or not S affects a specified set of statements, given that all conditionals in are interpreted as non-d...
JOC
2000
13 years 8 months ago
2000
Abstract. Since the appearance of public-key cryptography in the seminal DiffieHellman paper, many new schemes have been proposed and many have been broken. Thus, the simple fact t...
ATAL
2005
Springer
14 years 2 months ago
2005
Springer
In many multi agent learning problems, it is difficult to determine, a priori, the agent reward structure that will lead to good performance. This problem is particularly pronoun...
IWOCA
2009
Springer
14 years 1 months ago
2009
Springer
We investigate the problem of the maximum number of cubic subwords (of the form www) in a given word. We also consider square subwords (of the form ww). The problem of the maximum ...
NIPS
2008
13 years 10 months ago
2008
Many popular optimization algorithms, like the Levenberg-Marquardt algorithm (LMA), use heuristic-based "controllers" that modulate the behavior of the optimizer during ...