Sciweavers

4198 search results - page 281 / 840
» In search of lost time
Sort
View
ESWA
2007
100views more  ESWA 2007»
15 years 6 months ago
Using memetic algorithms with guided local search to solve assembly sequence planning
The goal of assembly planning consists in generating feasible sequences to assemble a product and selecting an efficient assembly sequence from which related constraint factors su...
Hwai-En Tseng, Wen-Pai Wang, Hsun-Yi Shih
PVLDB
2010
123views more  PVLDB 2010»
15 years 5 months ago
Toward Scalable Keyword Search over Relational Data
Keyword search (KWS) over relational databases has recently received significant attention. Many solutions and many prototypes have been developed. This task requires addressing ...
Akanksha Baid, Ian Rae, Jiexing Li, AnHai Doan, Je...
SSDBM
2010
IEEE
133views Database» more  SSDBM 2010»
15 years 4 months ago
PrefIndex: An Efficient Supergraph Containment Search Technique
Graphs are prevailingly used in many applications to model complex data structures. In this paper, we study the problem of supergraph containment search. To avoid the NP-complete s...
Gaoping Zhu, Xuemin Lin, Wenjie Zhang, Wei Wang, H...
UAI
1990
15 years 8 months ago
Ideal reformulation of belief networks
The intelligent reformulation or restructuring of a belief network can greatly increase the efficiency of inference. However, time expended for reformulation is not available for ...
Jack S. Breese, Eric Horvitz
SIGMOD
2002
ACM
246views Database» more  SIGMOD 2002»
16 years 6 months ago
Hierarchical subspace sampling: a unified framework for high dimensional data reduction, selectivity estimation and nearest neig
With the increased abilities for automated data collection made possible by modern technology, the typical sizes of data collections have continued to grow in recent years. In suc...
Charu C. Aggarwal