Sciweavers

690 search results - page 120 / 138
» Multi-Agent Only Knowing
Sort
View
AWIC
2003
Springer
14 years 2 months ago
Secure Intelligent Agents Based on Formal Description Techniques
This paper describes a practical solution for the incorporation of security services in agents. From a set of basic user requirements, the agents will be able to find out the best ...
L. Mengual, C. de la Puente
GECCO
2003
Springer
14 years 2 months ago
Enhancing the Performance of GP Using an Ancestry-Based Mate Selection Scheme
The performance of genetic programming relies mostly on population-contained variation. If the population diversity is low then there will be a greater chance of the algorithm bein...
Rodney Fry, Andrew M. Tyrrell
STOC
2010
ACM
227views Algorithms» more  STOC 2010»
14 years 1 months ago
On the Round Complexity of Covert Computation
In STOC’05, von Ahn, Hopper and Langford introduced the notion of covert computation. In covert computation, a party runs a secure computation protocol over a covert (or stegano...
Vipul Goyal and Abhishek Jain
HUC
2009
Springer
14 years 1 months ago
ViridiScope: design and implementation of a fine grained power monitoring system for homes
A key prerequisite for residential energy conservation is knowing when and where energy is being spent. Unfortunately, the current generation of energy reporting devices only prov...
Younghun Kim, Thomas Schmid, Zainul Charbiwala, Ma...
SAGA
2001
Springer
14 years 1 months ago
Stochastic Finite Learning
Inductive inference can be considered as one of the fundamental paradigms of algorithmic learning theory. We survey results recently obtained and show their impact to potential ap...
Thomas Zeugmann