3323 search results - page 265 / 665 » Computational Semantics with Functional Programming |
157
click to vote
BIRTHDAY
1994
Springer
15 years 10 months ago
1994
Springer
Cook's construction from 1971 [4] shows that any two-way deterministic pushdown automaton (2DPDA) can be simulated in time O(n), where n is the length of its input string, and...
172
click to vote
AI
2000
Springer
15 years 6 months ago
2000
Springer
Markov decisionprocesses(MDPs) haveproven to be popular models for decision-theoretic planning, but standard dynamic programming algorithms for solving MDPs rely on explicit, stat...
177
click to vote
ICALP
2010
Springer
15 years 8 months ago
2010
Springer
d Abstract) Benny Applebaum1 , Yuval Ishai2 , and Eyal Kushilevitz3 1 Computer Science Department, Weizmann Institute of Science 2 Computer Science Department, Technion and UCLA 3 ...
340
click to vote
OL
2011
15 years 1 months ago
2011
We consider sequential quadratic programming (SQP) methods for solving constrained nonlinear programming problems. It is generally believed that SQP methods are sensitive to the a...
175
click to vote
BMCBI
2010
15 years 6 months ago
2010
Background: The estimation of demographic parameters from genetic data often requires the computation of likelihoods. However, the likelihood function is computationally intractab...