Sciweavers

1816 search results - page 228 / 364
» A New Approach for Solving the Maximum Clique Problem
Sort
View
ICRA
2003
IEEE
178views Robotics» more  ICRA 2003»
15 years 12 months ago
Design of six sigma supply chains
Abstract—Variability reduction and business process synchronization are acknowledged as key to achieving sharp and timely deliveries in supply chain networks. In this paper, we i...
Dinesh Garg, Yadati Narahari, Nukala Viswanadham
KDD
2008
ACM
104views Data Mining» more  KDD 2008»
16 years 7 months ago
Succinct summarization of transactional databases: an overlapped hyperrectangle scheme
Transactional data are ubiquitous. Several methods, including frequent itemsets mining and co-clustering, have been proposed to analyze transactional databases. In this work, we p...
Yang Xiang, Ruoming Jin, David Fuhry, Feodor F. Dr...
CP
2006
Springer
15 years 10 months ago
Mini-bucket Elimination with Bucket Propagation
Many important combinatorial optimization problems can be expressed as constraint satisfaction problems with soft constraints. When problems are too difficult to be solved exactly,...
Emma Rollon, Javier Larrosa
IJCAI
2007
15 years 8 months ago
Building Structure into Local Search for SAT
Local search procedures for solving satisfiability problems have attracted considerable attention since the development of GSAT in 1992. However, recent work indicates that for m...
Duc Nghia Pham, John Thornton, Abdul Sattar
ICCAD
2001
IEEE
192views Hardware» more  ICCAD 2001»
16 years 3 months ago
BOOM - A Heuristic Boolean Minimizer
We present a two-level Boolean minimization tool (BOOM) based on a new implicant generation paradigm. In contrast to all previous minimization methods, where the implicants are ge...
Jan Hlavicka, Petr Fiser