9626 search results - page 480 / 1926 » Invariant Based Programming |
224
click to vote
NCA
2008
IEEE
15 years 6 months ago
2008
IEEE
The paper focuses on the study of solving the large-scale traveling salesman problem (TSP) based on neurodynamic programming. From this perspective, two methods, temporal differenc...
159
click to vote
IOR
2010
15 years 5 months ago
2010
This paper introduces disjunctive decomposition for two-stage mixed 0-1 stochastic integer programs (SIPs) with random recourse. Disjunctive decomposition allows for cutting plane...
169
click to vote
ACL
2010
15 years 4 months ago
2010
Incremental parsing techniques such as shift-reduce have gained popularity thanks to their efficiency, but there remains a major problem: the search is greedy and only explores a ...
151
click to vote
ALP
1990
Springer
15 years 11 months ago
1990
Springer
Conditional Equational Programming is an elegant way to uniformly integrate important features of functional and logic programming. Efficientmethods for equation solving are thus ...
171
click to vote
SIGSOFT
2010
ACM
15 years 1 months ago
2010
ACM
We argue that lightweight, language-based verification is poised to enter mainstream industrial use, where it will have a major impact on software quality and reliability. We expl...