Sciweavers

16596 search results - page 388 / 3320
» Generalized Assignment Problems
Sort
View
145
Voted
CORR
2010
Springer
95views Education» more  CORR 2010»
15 years 4 months ago
From Holant To #CSP And Back: Dichotomy For Holant$^c$ Problems
We explore the intricate interdependent relationship among counting problems, considered from three frameworks for such problems: Holant Problems, counting CSP and weighted H-color...
Jin-yi Cai, Sangxia Huang, Pinyan Lu
168
Voted
ICCAD
2002
IEEE
104views Hardware» more  ICCAD 2002»
16 years 4 months ago
A new enhanced SPFD rewiring algorithm
This paper presents an in-depth study of the theory and algorithms for the SPFD-based (Set of Pairs of Functions to be Distinguished) rewiring, and explores the flexibility in the...
Jason Cong, Joey Y. Lin, Wangning Long
DAC
2010
ACM
15 years 7 months ago
Performance and power modeling in a multi-programmed multi-core environment
This paper describes a fast, automated technique for accurate on-line estimation of the performance and power consumption of interacting processes in a multi-programmed, multi-cor...
Xi Chen, Chi Xu, Robert P. Dick, Zhuoqing Morley M...
175
Voted
MP
2006
77views more  MP 2006»
15 years 7 months ago
Zigzag inequalities: a new class of facet-inducing inequalities for Arc Routing Problems
In this paper we introduce a new class of facet-inducing inequalities for the Windy Rural Postman Problem and the Windy General Routing Problem. These inequalities are called Zigz...
Angel Corberán, Isaac Plana, José M....
193
Voted
STOC
2003
ACM
140views Algorithms» more  STOC 2003»
16 years 7 months ago
Approximation schemes for clustering problems
We present a general approach for designing approximation algorithms for a fundamental class of geometric clustering problems in arbitrary dimensions. More specifically, our appro...
Wenceslas Fernandez de la Vega, Marek Karpinski, C...