Sciweavers

1599 search results - page 233 / 320
» Algorithms for Parity Games
Sort
View
BMCBI
2002
131views more  BMCBI 2002»
14 years 9 months ago
Efficient Boolean implementation of universal sequence maps (bUSM)
Background: Recently, Almeida and Vinga offered a new approach for the representation of arbitrary discrete sequences, referred to as Universal Sequence Maps (USM), and discussed ...
John Schwacke, Jonas S. Almeida
FUIN
2010
130views more  FUIN 2010»
14 years 8 months ago
SLGAD Resolution for Inference on Logic Programs with Annotated Disjunctions
Abstract. Logic Programs with Annotated Disjunctions (LPADs) allow to express probabilistic information in logic programming. The semantics of an LPAD is given in terms of the well...
Fabrizio Riguzzi
AAMAS
2011
Springer
14 years 4 months ago
Using focal point learning to improve human-machine tacit coordination
We consider an automated agent that needs to coordinate with a human partner when communication between them is not possible or is undesirable (tacit coordination games). Specifi...
Inon Zuckerman, Sarit Kraus, Jeffrey S. Rosenschei...
CORR
2011
Springer
196views Education» more  CORR 2011»
14 years 1 months ago
Privacy-Enhanced Reputation-Feedback Methods to Reduce Feedback Extortion in Online Auctions
In this paper, we study methods for improving the utility and privacy of reputation scores for online auctions, such as used in eBay, so as to reduce the effectiveness of feedbac...
Michael T. Goodrich, Florian Kerschbaum
CVIU
2011
14 years 1 months ago
Graph-based quadratic optimization: A fast evolutionary approach
Quadratic optimization lies at the very heart of many structural pattern recognition and computer vision problems, such as graph matching, object recognition, image segmentation, ...
Samuel Rota Bulò, Marcello Pelillo, Immanue...