Sciweavers

1026 search results - page 140 / 206
» On Finding Minimal w-cutset
Sort
View
RSCTC
2000
Springer
151views Fuzzy Logic» more  RSCTC 2000»
14 years 20 days ago
Anytime Algorithm for Feature Selection
Feature selection is used to improve performance of learning algorithms by finding a minimal subset of relevant features. Since the process of feature selection is computationally ...
Mark Last, Abraham Kandel, Oded Maimon, Eugene Ebe...
ASPDAC
1995
ACM
127views Hardware» more  ASPDAC 1995»
14 years 20 days ago
Reclocking for high-level synthesis
In this paper we describe, a powerful post-synthesis approach called reclocking, for performance improvement by minimizing the total execution time. By back annotating the wire del...
Pradip K. Jha, Nikil D. Dutt, Sri Parameswaran
VLDB
1991
ACM
122views Database» more  VLDB 1991»
14 years 18 days ago
An Iterative Method for Distributed Database Design
The development of a distributed database systemrequires effective solutions to many complex and interrelated design problems. The cost dependenciesbetween query optimization and ...
Rex Blankinship, Alan R. Hevner, S. Bing Yao
DLOG
2008
13 years 11 months ago
Explanation in DL-Lite
The paper addresses the problem of explaining some reasoning tasks associated with the DL-Lite Description Logic. Because of the simplicity of the language, standard concept level ...
Alexander Borgida, Diego Calvanese, Mariano Rodrig...
WSC
2007
13 years 11 months ago
Stability analysis of the supply chain by using neural networks and genetic algorithms
Effectively managing a supply chain requires visibility to detect unexpected variations in the dynamics of the supply chain environment at an early stage. This paper proposes a me...
Alfonso Sarmiento, Luis Rabelo, Ramamoorthy Lakkoj...