Sciweavers

11740 search results - page 251 / 2348
» More Problems in Rewriting
Sort
View
BIOCOMP
2006
15 years 8 months ago
Parameterized Computation of LCS for Two Sequences
- The problem of finding the longest common subsequence is a well-known optimization problem because of its applications, especially in bioinformatics. In this paper, by applying t...
Yuan Lin, Jeff Jenness, Xiuzhen Huang
DM
2008
88views more  DM 2008»
15 years 6 months ago
Packing triangles in low degree graphs and indifference graphs
We consider the problems of finding the maximum number of vertex-disjoint triangles (VTP) and edge-disjoint triangles (ETP) in a simple graph. Both problems are NP-hard. The algor...
Gordana Manic, Yoshiko Wakabayashi
CSCLP
2007
Springer
16 years 22 days ago
A Global Filtration for Satisfying Goals in Mutual Exclusion Networks
We formulate a problem of goal satisfaction in mutex networks in this paper. The proposed problem is motivated by problems that arise in concurrent planning. For more efficient sol...
Pavel Surynek
BIRTHDAY
2004
Springer
15 years 12 months ago
Engineers Don't Search
Abstract. This paper is on the automation of knowledge-intensive tasks in engineering domains; here, the term “task” relates to analysis and synthesis tasks, such as diagnosis ...
Benno Stein
AI
2001
Springer
15 years 11 months ago
Concept-Learning in the Presence of Between-Class and Within-Class Imbalances
In a concept learning problem, imbalances in the distribution of the data can occur either between the two classes or within a single class. Yet, although both types of imbalances ...
Nathalie Japkowicz