2398 search results - page 256 / 480 » Constraint Programming and Graph Algorithms |
142
click to vote
ICALP
2010
Springer
15 years 11 months ago
2010
Springer
We show that the downward-closure of a Petri net language is effectively computable. This is mainly done by using the notions defined for showing decidability of the reachability...
186
click to vote
ISBRA
2009
Springer
16 years 1 months ago
2009
Springer
Recent techniques increase the amount of our knowledge of interactions between proteins. To filter, interpret and organize this data, many authors have provided tools for querying...
146
click to vote
ICALP
2005
Springer
15 years 12 months ago
2005
Springer
We consider the problem of efficiently designing sets (codes) of equal-length DNA strings (words) that satisfy certain combinatorial constraints. This problem has numerous motivati...
171
click to vote
ICLP
2004
Springer
15 years 11 months ago
2004
Springer
Arc-Consistency (AC) techniques have been used extensively in the study of Constraint Satisfaction Problems (CSP). These techniques are used to simplify the CSP before or during th...
168
click to vote
ISIPTA
2003
IEEE
15 years 11 months ago
2003
IEEE
A second-order hierarchical uncertainty model of a system of independent random variables is studied in the paper. It is shown that the complex nonlinear optimization problem for ...