Sciweavers

855 search results - page 22 / 171
» Complexity of Equations over Sets of Natural Numbers
Sort
View
CORR
2008
Springer
137views Education» more  CORR 2008»
14 years 9 months ago
On the Complexity of Nash Equilibria of Action-Graph Games
Abstract. We consider the problem of computing Nash Equilibria of action-graph games (AGGs). AGGs, introduced by Bhat and Leyton-Brown, is a succinct representation of games that e...
Constantinos Daskalakis, Grant Schoenebeck, Gregor...
BMCBI
2006
157views more  BMCBI 2006»
14 years 9 months ago
Determination of the minimum number of microarray experiments for discovery of gene expression patterns
Background: One type of DNA microarray experiment is discovery of gene expression patterns for a cell line undergoing a biological process over a series of time points. Two import...
Fang-Xiang Wu, W. J. Zhang, Anthony J. Kusalik
174
Voted
VLDB
2004
ACM
112views Database» more  VLDB 2004»
15 years 10 months ago
Tracking set-expression cardinalities over continuous update streams
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. In i...
Sumit Ganguly, Minos N. Garofalakis, Rajeev Rastog...
122
Voted
SAS
1992
Springer
171views Formal Methods» more  SAS 1992»
15 years 1 months ago
Static Analysis of CLP Programs over Numeric Domains
Abstract Constraint logic programming (CLP) is a generalization of the pure logic programming paradigm, having similar model-theoretic, fixpoint and operational semantics [9]. Sinc...
Roberto Bagnara, Roberto Giacobazzi, Giorgio Levi
ATAL
2008
Springer
14 years 11 months ago
Quantifying over coalitions in epistemic logic
Some natural epistemic properties which may arise in applications can only be expressed in standard epistemic logic by formulae which are exponentially long in the number of agent...
Thomas Ågotnes, Wiebe van der Hoek, Michael ...