2273 search results - page 421 / 455 » On the Expressiveness and Complexity of ATL |
AUSAI
1998
Springer
15 years 2 months ago
1998
Springer
Agent-based computing in Arti cial Intelligence has given rise to a number of diverse and competing proposals for agent programming languages. Agents, in the sense we are using it...
SIGIR
1998
ACM
15 years 1 months ago
1998
ACM
Abstract We present a fast compression and decompression scheme for natural language texts that allows e cient and exible string matching by searching the compressed text directly....
INFOCOM
1997
IEEE
15 years 1 months ago
1997
IEEE
A packet scheduler in a quality-of-service QoS network should be sophisticated enough to support stringent QoS constraints at high loads, but it must also have a simple implemen...
106
click to vote
ECP
1997
Springer
15 years 1 months ago
1997
Springer
In this paper we describe SINERGY, which is a highly parallelizable, linear planning system that is based on the genetic programming paradigm. Rather than reasoning about the world...
116
click to vote
COLT
1993
Springer
15 years 1 months ago
1993
Springer
The Vapnik-Chervonenkis (V-C) dimension is an important combinatorial tool in the analysis of learning problems in the PAC framework. For polynomial learnability, we seek upper bou...