4843 search results - page 400 / 969 » The Shortcut Problem - Complexity and Approximation |
120
click to vote
CPM
2006
Springer
15 years 8 months ago
2006
Springer
Many algorithms for motif finding that are commonly used in bioinformatics start by sampling r potential motif occurrences from n input sequences. The motif is derived from these s...
168
click to vote
ACM
1995
15 years 8 months ago
1995
We study properties of rough sets, that is, approximations to sets of records in a database or, more formally, to subsets of the universe of an information system. A rough set is a...
148
click to vote
ASPDAC
2005
ACM
15 years 6 months ago
2005
ACM
Abstract— The sparsification of the reluctance matrix L−1 (where L denotes the usual inductance matrix L) has been widely used in several recent investigations to make the pro...
135
click to vote
IJCAI
2003
15 years 6 months ago
2003
A longstanding goal in planning research is the ability to generalize plans developed for some set of environments to a new but similar environment, with minimal or no replanning....
139
click to vote
PPSC
1997
15 years 6 months ago
1997
It seems likely that improvements in arithmetic speed will continue to outpace advances in communication bandwidth. Furthermore, as more and more problems are working on huge datas...