1368 search results - page 84 / 274 » Recursive modules for programming |
POPL
2010
ACM
14 years 6 months ago
2010
ACM
Serializability is a commonly used correctness condition in concurrent programming. When a concurrent module is serializable, certain other properties of the module can be verifie...
DATE
2003
IEEE
14 years 2 months ago
2003
IEEE
Wireplanning is an approach in which the timing of inputoutput paths is planned before modules are specified, synthesized or sized. If these global wires are optimally segmented ...
GECCO
2004
Springer
14 years 2 months ago
2004
Springer
In this paper, we compare the performance of hierarchical GP methods (Automatically Defined Functions, Module Acquisition, Adaptive Representation through Learning) with the canon...
CPM
2000
Springer
14 years 1 months ago
2000
Springer
Abstract. Ambiguity in dynamic programming arises from two independent sources, the non-uniqueness of optimal solutions and the particular recursion scheme by which the search spac...
EOR
2006
13 years 9 months ago
2006
: This paper addresses the problem of computing minimum risk paths by taking as objective the expected accident cost. The computation is based on a dynamic programming formulation ...