Sciweavers

440 search results - page 62 / 88
» Local reasoning for abstraction and sharing
Sort
View
ESAW
2006
Springer
15 years 5 months ago
Using Constraints and Process Algebra for Specification of First-Class Agent Interaction Protocols
Abstract. Current approaches to multi-agent interaction involve specifying protocols as sets of possible interactions, and hard-coding decision mechanisms into agent programs in or...
Tim Miller, Peter McBurney
PLDI
2012
ACM
13 years 4 months ago
Speculative linearizability
Linearizability is a key design methodology for reasoning about tations of concurrent abstract data types in both shared memory and message passing systems. It provides the illusi...
Rachid Guerraoui, Viktor Kuncak, Giuliano Losa
AIIA
2007
Springer
15 years 8 months ago
Towards Automated Game Design
Abstract. Game generation systems perform automated, intelligent design of games (i.e. videogames, boardgames), reasoning about both the rule system of the game and the visual real...
Mark J. Nelson, Michael Mateas
ICLP
2010
Springer
15 years 5 months ago
Bisimilarity in Concurrent Constraint Programming
Abstract. In this doctoral work we aim at developing a new approach to labelled semantics and equivalences for the Concurrent Constraint Programming (CCP) which will enable a broad...
Andres A. Aristizabal P.
ICDE
2009
IEEE
100views Database» more  ICDE 2009»
16 years 3 months ago
Recommendation Diversification Using Explanations
Abstract-- We introduce the novel notion of explanationbased diversification to address the well-known problem of overspecialization in item recommendations. Over-specialization in...
Cong Yu, Laks V. S. Lakshmanan, Sihem Amer-Yahia