21 search results - page 4 / 5 » Learning to verify branching time properties |
ATAL
2010
Springer
13 years 8 months ago
2010
Springer
Experimental analysis of networks of cooperative learning agents (to verify certain properties such as the system's stability) has been commonly used due to the complexity of...
WWW
2009
ACM
14 years 7 months ago
2009
ACM
In Web-based services of dynamic content (such as news articles), recommender systems face the difficulty of timely identifying new items of high-quality and providing recommendat...
IJIT
2004
13 years 8 months ago
2004
As computer network technology becomes increasingly complex, it becomes necessary to place greater requirements on the validity of developing standards and the resulting technology...
TSP
2010
13 years 1 months ago
2010
Abstract--Multichannel fast QR decomposition RLS (MCFQRD-RLS) algorithms are well known for their good numerical properties and low computational complexity. The main limitation is...
SDM
2008
SIAM
13 years 8 months ago
2008
SIAM
In this paper we explore private computation built on vector addition and its applications in privacypreserving data mining. Vector addition is a surprisingly general tool for imp...