Comet (programming language)
Comet is a commercial programming language designed by at-the-time Brown University professor Dr. Pascal Van Hentenryck and used to solve complex combinatorial optimization problems in areas such as resource allocation and scheduling. It offers a range of optimization algorithms: from 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 constraints, constraint combinators, and objective functions;
- a search procedure expressed in terms of the model at a high abstraction level.
This approach promotes reusability across applications.
Its API allows it to be used as a software library. Comet also features high-level abstractions for parallel and distributed computing, based on loop scheduling, interrupts, and work stealing.
References[edit]
- ↑ Taylor, J., "First Look - Dynadec Comet", July 8, 2009
External links[edit]
- Comet homepage at Dynadec (defunct)
- Constraint-Based Local Search by Pascal Van Hentenryck and Laurent Michel. The MIT Press, 2005.
This article "Comet (programming language)" is from Wikipedia. The list of its authors can be seen in its historical and/or the page Edithistory:Comet (programming language). Articles copied from Draft Namespace on Wikipedia could be seen on the Draft Namespace of Wikipedia and not main one.
