Sciweavers

16404 search results - page 796 / 3281
» A set coverage problem
Sort
View
IAT
2006
IEEE
16 years 1 months ago
A Q-decomposition LRTDP Approach to Resource Allocation
This paper contributes to solve effectively stochastic resource allocation problems known to be NP-Complete. To address this complex resource management problem, the merging of tw...
Pierrick Plamondon, Brahim Chaib-draa, Abder Rezak...
ASPDAC
2006
ACM
116views Hardware» more  ASPDAC 2006»
16 years 1 months ago
Post-routing redundant via insertion for yield/reliability improvement
- Reducing the yield loss due to via failure is one of the important problems in design for manufacturability. A well known and highly recommended method to improve via yield/relia...
Kuang-Yao Lee, Ting-Chi Wang
CVPR
2010
IEEE
16 years 1 months ago
Fast Sparse Representation with Prototypes
Sparse representation has found applications in numerous domains and recent developments have been focused on the convex relaxation of the 0-norm minimization for sparse coding (i...
Jia-Bin Huang, Ming-Hsuan Yang
ETFA
2005
IEEE
16 years 1 months ago
Quantized optimal control of discrete-time systems
In this paper we consider a quantized discrete-time linear quadratic regulator (DLQR) problem, namely a DLQR problem where the input u may only take values in a given finite set ...
Daniele Corona, Alessandro Giua, Carla Seatzu
ICDM
2005
IEEE
146views Data Mining» more  ICDM 2005»
16 years 1 months ago
Merging Interface Schemas on the Deep Web via Clustering Aggregation
We consider the problem of integrating a large number of interface schemas over the Deep Web, The scale of the problem and the diversity of the sources present serious challenges ...
Wensheng Wu, AnHai Doan, Clement T. Yu