Sciweavers

3359 search results - page 377 / 672
» A Simplified Idea Algorithm
Sort
View
DEXA
2006
Springer
138views Database» more  DEXA 2006»
15 years 10 months ago
A Vector Space Model for Semantic Similarity Calculation and OWL Ontology Alignment
Ontology alignment (or matching) is the operation that takes two ontologies and produces a set of semantic correspondences (usually semantic similarities) between some elements of ...
Rubén Tous, Jaime Delgado
CASES
2001
ACM
15 years 10 months ago
Tailoring pipeline bypassing and functional unit mapping to application in clustered VLIW architectures
In this paper we describe a design exploration methodology for clustered VLIW architectures. The central idea of this work is a set of three techniques aimed at reducing the cost ...
Marcio Buss, Rodolfo Azevedo, Paulo Centoducatte, ...
CP
2000
Springer
15 years 10 months ago
Using Randomization and Learning to Solve Hard Real-World Instances of Satisfiability
This paper addresses the interaction between randomization, with restart strategies, and learning, an often crucial technique for proving unsatisfiability. We use instances of SAT ...
Luís Baptista, João P. Marques Silva
EURODAC
1995
IEEE
138views VHDL» more  EURODAC 1995»
15 years 10 months ago
Reduced design time by load distribution with CAD framework methodology information
This paper is focused on reducing the design time in a CAD framework environment by the optimal use of resources. A user-transparent load distribution system (Framework based LOad...
Jürgen Schubert, Arno Kunzmann, Wolfgang Rose...
KDD
1995
ACM
140views Data Mining» more  KDD 1995»
15 years 10 months ago
Decision Tree Induction: How Effective is the Greedy Heuristic?
Mostexisting decision tree systemsuse a greedyapproachto inducetrees -- locally optimalsplits are inducedat every node of the tree. Althoughthe greedy approachis suboptimal,it is ...
Sreerama K. Murthy, Steven Salzberg