Sciweavers

866 search results - page 71 / 174
» A Formal Investigation of
Sort
View
SYNTHESE
2010
130views more  SYNTHESE 2010»
13 years 8 months ago
Belief ascription under bounded resources
There exists a considerable body of work on epistemic logics for resource-bounded reasoners. In this paper, we concentrate on a less studied aspect of resource-bounded reasoning, n...
Natasha Alechina, Brian Logan
INFOCOM
2002
IEEE
14 years 2 months ago
Clustering Overhead for Hierarchical Routing in Mobile Ad hoc Networks
Numerous clustering algorithms have been proposed that can support routing in mobile ad hoc networks (MANETs). However, there is very little formal analysis that considers the comm...
John Sucec, Ivan Marsic
ATAL
2009
Springer
14 years 4 months ago
Of robot ants and elephants
Investigations of multi-robot systems often make implicit assumptions concerning the computational capabilities of the robots. Despite the lack of explicit attention to the comput...
Asaf Shiloni, Noa Agmon, Gal A. Kaminka
SAFECOMP
1998
Springer
14 years 2 months ago
An Agenda for Specifying Software Components with Complex Data Models
Abstract. We present a method to specify software for a special kind of safetycritical embedded systems, where sensors deliver low-level values that must be abstracted and pre-proc...
Kirsten Winter, Thomas Santen, Maritta Heisel
GECCO
2006
Springer
159views Optimization» more  GECCO 2006»
14 years 1 months ago
Standard and averaging reinforcement learning in XCS
This paper investigates reinforcement learning (RL) in XCS. First, it formally shows that XCS implements a method of generalized RL based on linear approximators, in which the usu...
Pier Luca Lanzi, Daniele Loiacono