13603 search results - page 304 / 2721 » On the Complexity of Computing Treelength |
178
click to vote
ISAAC
2001
Springer
15 years 10 months ago
2001
Springer
A fragmentary pattern is a multiset of non-empty strings, and it matches a string w if all the strings in it occur within w without any overlaps. We study some fundamental issues o...
166
click to vote
ECP
1997
Springer
15 years 10 months ago
1997
Springer
A possibilistic approach of planning under uncertainty has been developed recently. It applies to problems in which the initial state is partially known and the actions have graded...
167
click to vote
VR
2000
IEEE
15 years 9 months ago
2000
IEEE
Virtual environments have shown great promise as a research tool in science and engineering. In this paper we study a classical problem in mathematics: that of approximating globa...
163
Voted
ESANN
2003
15 years 7 months ago
2003
Abstract. This paper considers the general problem of function estimation with a modular approach of neural computing. We propose to use functionally independent subnetworks to lea...
165
Voted
WSCG
2004
15 years 7 months ago
2004
One of the most important problems to solve in Solid Modeling is computing boolean operations for solids (union, intersection and difference). In this paper we present a method to...