639 search results - page 119 / 128 » A Finite State Mobile Agent Computation Model |
AIPS
2011
14 years 1 months ago
2011
Engineering complete planning domain descriptions is often very costly because of human error or lack of domain knowledge. Learning complete domain descriptions is also very chall...
102
click to vote
WIOPT
2010
IEEE
14 years 7 months ago
2010
IEEE
— By analyzing people’s contact patterns over time, it is possible to build efficient delay tolerant networking (DTN) algorithms and derive important data for parameterizing an...
ICLP
2010
Springer
15 years 1 months ago
2010
Springer
hex programs were originally introduced as a general framework for extending declarative logic programming, under the stable model semantics, with the possibility of bidirectional...
GECCO
2004
Springer
15 years 2 months ago
2004
Springer
Abstract. This paper continues our systematic study of an RNAediting computational model of Genetic Algorithms (GA). This model is constructed based on several genetic editing char...
PADS
2004
ACM
15 years 2 months ago
2004
ACM
Computer simulation is the most common approach to studying wireless ad-hoc routing algorithms. The results, however, are only as good as the models the simulation uses. One shoul...