Sciweavers

2337 search results - page 112 / 468
» Is the Open Way a Better Way
Sort
View
CSCWD
2005
Springer
15 years 11 months ago
Content-Oriented Knowledge Modeling for Automated Parts Library Ontology Merging
The digital parts libraries or electronic parts catalogs have opened up a vast potential for new electronic forms of product components procurement. However, their seamless integra...
Joonmyun Cho, Hyun Kim, Soonhung Han
ICCBR
2005
Springer
15 years 11 months ago
Cooperative Reuse for Compositional Cases in Multi-agent Systems
Abstract. We present a form of case-based reuse conducive to the cooperation of multiple CBR agents in problem solving. First, we present a form of constructive adaptation for con...
Enric Plaza
ICCS
2005
Springer
15 years 11 months ago
What Makes the Arc-Preserving Subsequence Problem Hard?
Abstract. Given two arc-annotated sequences (S, P) and (T, Q) representing RNA structures, the Arc-Preserving Subsequence (APS) problem asks whether (T, Q) can be obtained from (S,...
Guillaume Blin, Guillaume Fertin, Romeo Rizzi, St&...
LACL
2005
Springer
15 years 11 months ago
Learnable Classes of General Combinatory Grammars
Abstract. Kanazawa has shown that k-valued classical categorial grammars have the property of finite elasticity [1], which is a sufficient condition for learnability. He has also ...
Erwan Moreau
WEA
2005
Springer
154views Algorithms» more  WEA 2005»
15 years 11 months ago
Experimental Evaluation of the Greedy and Random Algorithms for Finding Independent Sets in Random Graphs
This work is motivated by the long-standing open problem of designing a polynomial-time algorithm that with high probability constructs an asymptotically maximum independent set in...
Mark K. Goldberg, D. Hollinger, Malik Magdon-Ismai...