Sciweavers

628 search results - page 40 / 126
» The minimum shift design problem
Sort
View
103
Voted
DAC
1999
ACM
16 years 1 months ago
Graph Coloring Algorithms for Fast Evaluation of Curtis Decompositions
Finding the minimum column multiplicity for a bound set of variables is an important problem in Curtis decomposition. To investigate this problem, we compared two graphcoloring pr...
Marek A. Perkowski, Rahul Malvi, Stan Grygiel, Mic...
CORR
2011
Springer
192views Education» more  CORR 2011»
14 years 7 months ago
On cooperative patrolling: optimal trajectories, complexity analysis, and approximation algorithms
—The subject of this work is the patrolling of an environment with the aid of a team of autonomous agents. We consider both the design of open-loop trajectories with optimal prop...
Fabio Pasqualetti, Antonio Franchi, Francesco Bull...
86
Voted
KDD
2004
ACM
173views Data Mining» more  KDD 2004»
16 years 1 months ago
A microeconomic data mining problem: customer-oriented catalog segmentation
The microeconomic framework for data mining [7] assumes that an enterprise chooses a decision maximizing the overall utility over all customers where the contribution of a custome...
Martin Ester, Rong Ge, Wen Jin, Zengjian Hu
96
Voted
TSP
2010
14 years 7 months ago
MIMO radar waveform design via alternating projection
Abstract--Waveform design is essential to unleash the performance advantages promised by multiple-input multiple-output (MIMO) radar, and this topic has attracted a lot of attentio...
Yang Yang, Rick S. Blum, Zishu He, Daniel R. Fuhrm...
DAC
2007
ACM
16 years 1 months ago
Gate Sizing For Cell Library-Based Designs
With increasing time-to-market pressure and shortening semiconductor product cycles, more and more chips are being designed with library-based methodologies. In spite of this shif...
Shiyan Hu, Mahesh Ketkar, Jiang Hu