Comet (programming language)
 | The topic of this article may not meet Wikipedia's general notability guideline. (September 2023) |
 | This article needs additional citations for verification. (September 2023) |
Comet is a commercial
mathematical programming to constraint programming, local search algorithms and "dynamic stochastic combinatorial optimization."[1]
Comet programs specify local search algorithms as two components:
- a high-level model describing the applications in terms of objective functions;
- a search procedure expressed in terms of the model at a high abstraction level.
This approach promotes reusability across applications.
Its
software library. Comet also features high-level abstractions for parallel and distributed computing, based on loop scheduling, interrupts, and work stealing
.
References
- ^ Taylor, J., "First Look - Dynadec Comet", July 8, 2009
External links
- Comet homepage at Dynadec (defunct)
- Constraint-Based Local Search by Pascal Van Hentenryck and Laurent Michel. The MIT Press, 2005.