University of Essex: Constraint Programming Group
Several very interesting projects: GENET; Guided Local Search, GLS; Guided Genetic Algorithm, GLS; Adaptive Constraint Satisfaction, ACS; Computer-Aided Constraint-Programming, CACP.
University of London, Royal Holloway: Constraints Group
In the Department of Computer Science: descriptions, research, members, publications, links.
University of Washington: Constraint-Based Systems
Constraints research group, Department of Computer Science and Engineering. Home of DeltaBlue, Cassowary. Neat constraint Java Applet demonstrates a theorem about quadrilaterals.
Constraints Archive
Holds comp.constraints FAQ, pages of constraint-related pointers, source code for various systems, benchmarks, directory of people interested in constraints, constraint bibliographies, collection of online papers, extensive links. Clearly the product of much work.
Advanced Constraint Techniques for User Interface Implementation
Project to develop and explore using advanced constraint methods to make user interface software. Constraints as a general computational technique allow declaring a set of relationships between entities. A constraint satisfaction system is employed to automatically ensure that the relationships hold under changing conditions.
Automated Construction of Virtual Worlds Using Modeling Constraints
Designing and specifying 3D scenes is a tedious, time consuming process that often degenerates into trial and error. We propose a new way to form virtual worlds based on geometric modeling constraints and higher-level modeling abstractions.
Book: Foundations of Constraint Satisfaction
Description of book, Academic Press, release 1993: programs from book.
Book: Programming with Constraints: an Introduction
Description of book, MIT Press, release March 1998: programs from book, slides for courses for use with book.
Brandeis Interval Arithmetic Constraint Solver
Java applet that solves non-linear real arithmetic constraints.
Cassowary
Incremental constraint solving toolkit, efficiently solves systems of linear equalities, inequalities. Constraints can be requirements or preferences. Client code specifies constraints to maintain, and the solver updates constrained variables to have values that satisfy the constraints.
Constraint Handling Rules: CHR
High-level programming language to write constraint systems; makes it easy to define constraint reasoning: simplification and propagation, and incremental solving (satisfaction) of constraints. Run and test CHR online; do a demo, try it now.
Constraint-based Languages and Environments for Building Interactive Systems
Page about Alan Borning, a leading researcher in the field. From NSF conference ISGW '97: Interactive Systems Grantees Workshop.
Constraints: An International Journal
Covering all aspects of computing with constraints; on paper or online; fee required.
Constraints for the Web
Constraints can specify desired layout of web documents, and behavior of embedded applets: 2 system architectures where author and viewer can make layout constraints, needed and optional. Final appearance of page comes from negotiation between author and viewer, via solving all the constraints.
DeltaBlue: Benchmarking Java with Richards and DeltaBlue
Constraint solver benchmark, in Java; about 1000 lines of code. DeltaBlue first implemented by John Maloney at University of Washington, translated to many languages: C, C++, Java; Smalltalk. [Sun Microsystems Labs]
DeltaBlue Constraint Solver
Efficient, incremental local propagation constraint solver. Like most local propagation algorithms, it cannot accommodate cyclic constraints. University of Washington site.
A Differential Approach to Graphical Interaction
The ad hoc manner in which direct manipulation interfaces have been designed and implemented restricts the types of interactive controls. This dissertation presents a new approach for a systematic method to implement flexible, combinable interactive controls.
Explanation-based constraint programming
Definitions, applications, libraries, links.
FSQP: Feasible Sequential Quadratic Programming
By AEM Design: a source code for minimizing the maximum of a set of smooth objective functions subject to general smooth constraints. Two versions, written in portable: Fortran 77 (FFSQP), standard C (CFSQP). Both are tested and run on most platforms.
Garnet: Brad A. Myers
Personal page of Garnet inventor and lead researcher. Describes Garnet motives, rationale.
Results: Previous 1 2 3 4 5 6 7 8 9 10 Next
Site
Menu 
