2861 search results - page 166 / 573 » Constraint Programming |
124
Voted
ICPR
2008
IEEE
15 years 8 months ago
2008
IEEE
Graph cut algorithms (i.e., min s-t cuts) [3][10][15] are useful in many computer vision applications. In this paper we develop a formulation that allows the addition of side cons...
ICLP
1997
Springer
15 years 6 months ago
1997
Springer
We introduce and explore a property of deductive data bases with updates wich we call total homeostaticity, and which substantially generalizes the following their property: ”fo...
109
click to vote
CHI
1992
ACM
15 years 6 months ago
1992
ACM
We describe enhancements to graphical search and replace that allow users to extend the capabilities of a graphical editor. Interactive constraint-based search and replace can sea...
113
click to vote
COMSIS
2006
15 years 2 months ago
2006
Traditional knowledge representations were developed to encode complete, explicit and executable programs, a goal that makes them less than ideal for representing the incomplete an...
107
click to vote
CORR
2006
Springer
15 years 2 months ago
2006
Springer
In a previous work, the first author extended to higher-order rewriting and dependent types the use of size annotations in types, a termination proof technique called type or size ...