11740 search results - page 259 / 2348 » More Problems in Rewriting |
181
click to vote
AAAI
2004
15 years 8 months ago
2004
We present an efficient approach to adding soft constraints, in the form of preferences, to Disjunctive Temporal Problems (DTPs) and their subclass Temporal Constraint Satisfactio...
144
click to vote
EOR
2006
15 years 6 months ago
2006
The problem of routing and wavelength assignment in all-optical networks may be solved by a combined approach involving the computation of alternative routes for the lightpaths, f...
171
click to vote
CIARP
2003
Springer
15 years 10 months ago
2003
Springer
Classification problems are traditionally focused on uniclass samples, that is, each sample of the training and test sets has one unique label, which is the target of the classific...
166
click to vote
CCCG
1994
15 years 8 months ago
1994
We formulate the problem of computing the widest empty corridor with at most ` links and right-angle turns for a set of n points. It is a generalization of the widest empty corrid...
213
click to vote
SPIRE
2010
Springer
15 years 5 months ago
2010
Springer
The Longest Common Subsequence (LCS) of two or more strings is a fundamental well-studied problem which has a wide range of applications throughout computational sciences. When the...