Sciweavers

217 search results - page 23 / 44
» Circuit Complexity of Regular Languages
Sort
View
FOSSACS
2009
Springer
13 years 11 months ago
On Omega-Languages Defined by Mean-Payoff Conditions
In quantitative verification, system states/transitions have associated costs, and these are used to associate mean-payoff costs with infinite behaviors. In this paper, we propose ...
Rajeev Alur, Aldric Degorre, Oded Maler, Gera Weis...
CATS
2007
13 years 9 months ago
Planning with Time Limits in BDI Agent Programming Languages
This paper provides a theoretical basis for performing time limited planning within Belief-Desire-Intention (BDI) agents. The BDI agent architecture is recognised as one of the mo...
Lavindra de Silva, Anthony Dekker, James Harland
ENTCS
2006
101views more  ENTCS 2006»
13 years 7 months ago
Mumbo: A Rule-Based Implementation of a Run-time Program Generation Language
We describe our efforts to use rule-based programming to produce a model of Jumbo, a run-time program generation (RTPG) system for Java. Jumbo incorporates RTPG following the simp...
Baris Aktemur, Samuel N. Kamin
CIKM
2008
Springer
13 years 9 months ago
Rewriting of visibly pushdown languages for xml data integration
In this paper, we focus on XML data integration by studying rewritings of XML target schemas in terms of source schemas. Rewriting is very important in data integration systems wh...
Alex Thomo, Srinivasan Venkatesh
ACL
2006
13 years 9 months ago
Approximation Lasso Methods for Language Modeling
Lasso is a regularization method for parameter estimation in linear models. It optimizes the model parameters with respect to a loss function subject to model complexities. This p...
Jianfeng Gao, Hisami Suzuki, Bin Yu