Sciweavers

2111 search results - page 324 / 423
» How to Program Pervasive Systems
Sort
View
AAAI
1996
13 years 10 months ago
Computing Optimal Policies for Partially Observable Decision Processes Using Compact Representations
: Partially-observable Markov decision processes provide a very general model for decision-theoretic planning problems, allowing the trade-offs between various courses of actions t...
Craig Boutilier, David Poole
LDTA
2010
13 years 9 months ago
Faster ambiguity detection by grammar filtering
Real programming languages are often defined using ambiguous context-free grammars. Some ambiguity is intentional while other ambiguity is accidental. A good grammar development e...
H. J. S. Basten, Jurgen J. Vinju
CORR
2010
Springer
135views Education» more  CORR 2010»
13 years 9 months ago
Automatic derivation of domain terms and concept location based on the analysis of the identifiers
Abstract. Developers express the meaning of the domain ideas in specifically selected identifiers and comments that form the target implemented code. Software maintenance requires ...
Peter Václavík, Jaroslav Porubä...
CORR
2010
Springer
151views Education» more  CORR 2010»
13 years 9 months ago
Redundancies in Dependently Typed Lambda Calculi and Their Relevance to Proof Search
Dependently typed -calculi such as the Logical Framework (LF) are capable of representing relationships between terms through types. By exploiting the "formulas-as-types"...
Zachary Snow, David Baelde, Gopalan Nadathur
DB
2008
107views more  DB 2008»
13 years 9 months ago
Introducing function extraction into software testing
Software testing can benefit from technologies that enable evolution toward increased engineering discipline. In current practice, software developers lack practical means to dete...
Mark G. Pleszkoch, Richard C. Linger, Alan R. Hevn...