Sciweavers

882 search results - page 68 / 177
» Local Search for Very Large SAT Problems
Sort
View
IDEAS
2006
IEEE
98views Database» more  IDEAS 2006»
15 years 5 months ago
PAID: Mining Sequential Patterns by Passed Item Deduction in Large Databases
Sequential pattern mining is very important because it is the basis of many applications. Yet how to efficiently implement the mining is difficult due to the inherent characteri...
Zhenglu Yang, Masaru Kitsuregawa, Yitong Wang
SIAMJO
2002
149views more  SIAMJO 2002»
14 years 11 months ago
Semidefinite Programs: New Search Directions, Smoothing-Type Methods, and Numerical Results
Motivated by some results for linear programs and complementarity problems, this paper gives some new characterizations of the central path conditions for semidefinite programs. Ex...
Christian Kanzow, Christian Nagel
IPPS
1999
IEEE
15 years 4 months ago
A Parallel Genetic Algorithm for Task Mapping on Parallel Machines
In parallel processing systems, a fundamental consideration is the maximization of system performance through task mapping. A good allocation strategy may improve resource utilizat...
S. Mounir Alaoui, Ophir Frieder, Tarek A. El-Ghaza...
CVPR
2004
IEEE
16 years 1 months ago
Efficient Search of Faces from Complex Line Drawings
Single 2D line drawing is a straightforward method to illustrate 3D objects. The faces of an object depicted by a line drawing give very useful information for the reconstruction ...
Jianzhuang Liu, Xiaoou Tang
ICCD
2001
IEEE
176views Hardware» more  ICCD 2001»
15 years 8 months ago
BDD Variable Ordering by Scatter Search
Reduced Ordered Binary Decision Diagrams (BDDs) are a data structure for representation and manipulation of Boolean functions which are frequently used in VLSI Design Automation. ...
William N. N. Hung, Xiaoyu Song