Sciweavers

222 search results - page 20 / 45
» On the Refinement of Atomic Actions
Sort
View
HASE
2008
IEEE
14 years 2 months ago
Small Logs for Transactional Services: Distinction is Much More Accurate than (Positive) Discrimination
For complex services, logging is an integral part of many middleware aspects, especially, transactions and monitoring. In the event of a failure, the log allows us to deduce the c...
Debmalya Biswas, Thomas Gazagnaire, Blaise Genest
ACS
2006
13 years 7 months ago
Duality for Finite Hopf Algebras Explained by Corings
We give a coring version for the duality theorem for actions and coactions of a finitely generated projective Hopf algebra. We also provide a coring analogue for a theorem of H.-J....
Stefaan Caenepeel, D. Quinn, S. Raianu
ML
2006
ACM
113views Machine Learning» more  ML 2006»
13 years 7 months ago
Learning to bid in bridge
Bridge bidding is considered to be one of the most difficult problems for game-playing programs. It involves four agents rather than two, including a cooperative agent. In additio...
Asaf Amit, Shaul Markovitch
ADAEUROPE
2005
Springer
14 years 1 months ago
The Application of Compile-Time Reflection to Software Fault Tolerance Using Ada 95
Transparent system support for software fault tolerance reduces performance in general and precludes application-specific optimizations in particular. In contrast, explicit support...
Patrick Rogers, Andy J. Wellings
ICML
2007
IEEE
14 years 8 months ago
Statistical predicate invention
We propose statistical predicate invention as a key problem for statistical relational learning. SPI is the problem of discovering new concepts, properties and relations in struct...
Stanley Kok, Pedro Domingos