3082 search results - page 393 / 617 » its 2004 |
157
click to vote
CPAIOR
2004
Springer
16 years 6 days ago
2004
Springer
To improve solution robustness, we introduce the concept of super solutions to constraint programming. An (a, b)-super solution is one in which if a variables lose their values, th...
165
click to vote
CPAIOR
2004
Springer
16 years 6 days ago
2004
Springer
ng Abstractions for Local Search Pascal Van Hentenryck1 and Laurent Michel2 1 Brown University, Box 1910, Providence, RI 02912 2 University of Connecticut, Storrs, CT 06269-3155 Ab...
152
click to vote
CPM
2004
Springer
16 years 6 days ago
2004
Springer
Given two undirected trees T and P, the Subtree Homeomorphism Problem is to find whether T has a subtree t that can be transformed into P by removing entire subtrees, as well as ...
177
click to vote
CSL
2004
Springer
16 years 6 days ago
2004
Springer
Locality notions in logic say that the truth value of a formula can be determined locally, by looking at the isomorphism type of a small neighborhood of its free variables. Such n...
187
click to vote
CSL
2004
Springer
16 years 6 days ago
2004
Springer
We consider the problem of providing formal support for working tract syntax involving variable binders. Gabbay and Pitts have shown in their work on Fraenkel-Mostowski (FM) set th...