3146 search results - page 190 / 630 » Efficient Consequence Finding |
170
click to vote
IWANN
1997
Springer
15 years 10 months ago
1997
Springer
: The path planning problem is relevant for all applications in which a mobil robot should autonomously navigate. Finding the shortest path in an environment that is only partialy ...
164
click to vote
SIGCOMM
1992
ACM
15 years 10 months ago
1992
ACM
With the emergence of large switched public data networks that are well-suited to connectionless internets, for instance SMDS, it is possible that larger and larger numbers of int...
140
click to vote
ASPDAC
2004
ACM
15 years 10 months ago
2004
ACM
- Minimum area is one of the important objectives in technology mapping for lookup table-based FPGAs. It has been proven that the problem is NP-complete. This paper presents a poly...
155
click to vote
COCOON
2006
Springer
15 years 10 months ago
2006
Springer
: Inferring graphs from path frequency has been studied as an important problem which has a potential application to drug design and elucidation of chemical structures. Given a mul...
138
click to vote
DIS
2006
Springer
15 years 9 months ago
2006
Springer
This paper introduces a new family of string classifiers based on local relatedness. We use three types of local relatedness measurements, namely, longest common substrings (LCStr&...