Sciweavers

561 search results - page 4 / 113
» A Strategy for the Computation of Conditional Answers
Sort
View
SIGECOM
2010
ACM
184views ECommerce» more  SIGECOM 2010»
14 years 20 days ago
Computing pure strategy nash equilibria in compact symmetric games
We analyze the complexity of computing pure strategy Nash equilibria (PSNE) in symmetric games with a fixed number of actions. We restrict ourselves to “compact” representati...
Christopher Thomas Ryan, Albert Xin Jiang, Kevin L...
AGP
1997
IEEE
14 years 2 days ago
Safe Folding/Unfolding with Conditional Narrowing
Abstract. Functional logic languages with a complete operational semantics are based on narrowing, a generalization of term rewriting where unification replaces matching. In this ...
María Alpuente, Moreno Falaschi, Giné...
PVLDB
2010
134views more  PVLDB 2010»
13 years 6 months ago
Conditioning and Aggregating Uncertain Data Streams: Going Beyond Expectations
Uncertain data streams are increasingly common in real-world deployments and monitoring applications require the evaluation of complex queries on such streams. In this paper, we c...
Thanh T. L. Tran, Andrew McGregor, Yanlei Diao, Li...
PPDP
2001
Springer
14 years 8 days ago
Constructor-Based Conditional Narrowing
We define a transformation from a left-linear constructor-based conditional rewrite system into an overlapping inductively sequential rewrite system. This transformation is sound...
Sergio Antoy
DALT
2008
Springer
13 years 9 months ago
Inductive Negotiation in Answer Set Programming
This paper provides a logical framework of negotiating agents who have capabilities of evaluating and building proposals. Given a proposal, an agent decides whether it is acceptabl...
Chiaki Sakama