Sciweavers

2109 search results - page 229 / 422
» Solving Necklace Constraint Problems
Sort
View
DAC
2000
ACM
16 years 7 months ago
Dynamic power management of complex systems using generalized stochastic Petri nets
In this paper, we introduce a new technique for modeling and solving the dynamic power management (DPM) problem for systems with complex behavioral characteristics such as concurr...
Qinru Qiu, Qing Wu, Massoud Pedram
ISCAS
2003
IEEE
91views Hardware» more  ISCAS 2003»
15 years 11 months ago
SDP for multi-criterion QMF bank design
Quadraturemirror filter(QMF)bank with multi-criterion constraints suchas minimal aliasing and/or minimal error coding is amongthe most important problems in filter bank design, fo...
H. D. Tuan, L. H. Nam, H. Tuy, T. Q. Nguyen
ACML
2009
Springer
15 years 10 months ago
Max-margin Multiple-Instance Learning via Semidefinite Programming
In this paper, we present a novel semidefinite programming approach for multiple-instance learning. We first formulate the multipleinstance learning as a combinatorial maximum marg...
Yuhong Guo
ICCAD
2007
IEEE
134views Hardware» more  ICCAD 2007»
15 years 10 months ago
Efficient decoupling capacitance budgeting considering operation and process variations
This paper solves the variation-aware on-chip decoupling capacitance (decap) budgeting problem. Unlike previous work assuming the worst-case current load, we develop a novel stocha...
Yiyu Shi, Jinjun Xiong, Chunchen Liu, Lei He
ATAL
2008
Springer
15 years 8 months ago
BnB-ADOPT: an asynchronous branch-and-bound DCOP algorithm
Distributed constraint optimization problems (DCOPs) are a popular way of formulating and solving agent-coordination problems. It is often desirable to solve DCOPs optimally with m...
William Yeoh, Ariel Felner, Sven Koenig