CLAIRE

swMATH2583MaRDI QIDQ15122FDOQ15122

Author name not available (Why is that?)

Described by source

• CLAIRE: combining sets, search and rules to better express algorithms

Cited In (31)

• The use of a strategy language for solving search problems
• An O\((n^4)\) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
• Heuristics for large constrained vehicle routing problems
• Title not available (Why is that?)
• On-line resources allocation for ATM networks with rerouting
• Logic programming in the context of multiparadigm programming: the Oz experience
• Branching and pruning: An optimal temporal POCL planner based on constraint programming
• Title not available (Why is that?)
• Constraint-based scheduling: Applying constraint programming to scheduling problems.
• Title not available (Why is that?)
• Heuristic control of a constraint-based algorithm for the preemptive job-shop scheduling problem
• Handling relations over finite domains in the rule-based system ELAN
• Integration of Rules and Optimization in Plant PowerOps
• Title not available (Why is that?)
• Constraint programming viewed as rule-based programming
• Localizer
• Title not available (Why is that?)
• CLAIRE: A Distributed-Memory Solver for Constrained Large Deformation Diffeomorphic Image Registration
• Local consistency for extended CSPs
• A unified framework for partial and hybrid search methods in constraint programming
• Combining local and global search in a constraint programming environment
• On linear lower bounds for the resource constrained project scheduling problem.
• Cardinal: a finite sets constraint solver
• Title not available (Why is that?)
• Airspace sectorization with constraints
• Constraint propagation and decomposition techniques for highly disjunctive and highly cumulative project scheduling problems
• Combining constraint Propagation and meta-heuristics for searching a Maximum Weight Hamiltonian Chain
• Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming
• Resource constraints for preemptive job-shop scheduling
• Programming constraint services. High-level programming of standard and new constraint services
• Promoting rewriting to a programming language: A compiler for non-deterministic rewrite programs in associative-commutative theories

This page was built for software: CLAIRE