395 search results - page 24 / 79 » Decision Problems for Convex Languages |
LATA
2010
Springer
14 years 4 months ago
2010
Springer
Abstract. Iterated schemata allow to define infinite languages of propositional formulae through formulae patterns. Formally, schemata extend propositional logic with new (generali...
INFOCOM
2011
IEEE
12 years 11 months ago
2011
IEEE
Abstract—In this paper, we investigate the problem of maximizing the throughput over a finite-horizon time period for a sensor network with energy replenishment. The finite-horiz...
CSR
2007
Springer
14 years 1 months ago
2007
Springer
Abstract It has recently been proved (Je˙z, DLT 2007) that conjunctive grammars (that is, context-free grammars augmented by conjunction) generate some nonregular languages over a...
CCIA
2009
Springer
13 years 8 months ago
2009
Springer
Abstract. This paper presents J-MADeM, a new market-based multi-agent approach devoted to perform social simulations with BDI agents. J-MADeM is available as an open-source library...
TIT
2008
13 years 7 months ago
2008
Abstract--The ranking problem has become increasingly important in modern applications of statistical methods in automated decision making systems. In particular, we consider a for...