1228 search results - page 78 / 246 » Continuations, proofs and tests |
DBPL
1995
Springer
13 years 11 months ago
1995
Springer
We study the problem of maintaining recursively-de ned views, such as the transitive closure of a relation, in traditional relational languages that do not have recursion mechanis...
ICFP
2007
ACM
14 years 8 months ago
2007
ACM
It is rare to give a semantic definition of a full-scale programming language, despite the many potential benefits. Partly this is because the available metalanguages for expressi...
IJCNN
2006
IEEE
14 years 2 months ago
2006
IEEE
—The stationarity hypothesis is largely and implicitly assumed when designing classifiers (especially those for industrial applications) but it does not generally hold in practic...
CIS
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Survivability should be considered beyond security for networked information systems, which emphasizes the ability of continuing providing services timely in malicious en...
INFORMS
2007
13 years 8 months ago
2007
— We describe the development and testing of a metaheuristic procedure, based on the scatter search methodology, for the problem of approximating the efficient frontier of nonlin...