549 search results - page 23 / 110 » Constraint Programming in Structural Bioinformatics |
116
Voted
ICFP
2008
ACM
16 years 11 days ago
2008
ACM
MLF is a type system that seamlessly merges ML-style type inference with System-F polymorphism. We propose a system of graphic (type) constraints that can be used to perform type ...
106
click to vote
SAGT
2010
Springer
14 years 10 months ago
2010
Springer
The solution to a Nash or a nonsymmetric bargaining game is obtained by maximizing a concave function over a convex set, i.e., it is the solution to a convex program. We show that...
133
Voted
SNPD
2003
15 years 1 months ago
2003
The paper discusses simple functional constraint networks and a value propagation method for program construction. Structural synthesis of programs is described as an example of d...
85
Voted
IRAL
2000
ACM
15 years 4 months ago
2000
ACM
We propose a method to create process flow graphs automatically from textbooks for cooking programs. This is realized by understanding context by narrowing down the domain to cook...
99
Voted
CP
2004
Springer
15 years 4 months ago
2004
Springer
Scheduling is one of the most successful application areas of constraint programming mainly thanks to special global constraints designed to model resource restrictions. Among thes...