Sciweavers

584 search results - page 55 / 117
» Combinatorial optimization problems in wireless switch desig...
Sort
View
EOR
2011
140views more  EOR 2011»
13 years 15 days ago
Compact bidding languages and supplier selection for markets with economies of scale and scope
Combinatorial auctions have been used in procurement markets with economies of scope. Preference elicitation is already a problem in single-unit combinatorial auctions, but it bec...
Martin Bichler, Stefan Schneider, Kemal Guler, Meh...
JCO
2010
182views more  JCO 2010»
13 years 7 months ago
Polynomial time approximation schemes for minimum disk cover problems
The following planar minimum disk cover problem is considered in this paper: given a set D of n disks and a set P of m points in the Euclidean plane, where each disk covers a subse...
Chen Liao, Shiyan Hu
ASPDAC
2006
ACM
110views Hardware» more  ASPDAC 2006»
14 years 3 months ago
Switching-activity driven gate sizing and Vth assignment for low power design
Power consumption has gained much saliency in circuit design recently. One design problem is modelled as ”Under a timing constraint, to minimize power as much as possible”. Pr...
Yu-Hui Huang, Po-Yuan Chen, TingTing Hwang
COR
2007
106views more  COR 2007»
13 years 8 months ago
On a stochastic sequencing and scheduling problem
We present a framework for solving multistage pure 0–1 programs for a widely used sequencing and scheduling problem with uncertainty in the objective function coefficients, the...
Antonio Alonso-Ayuso, Laureano F. Escudero, M. Ter...
AI
2008
Springer
13 years 9 months ago
Solving quantified constraint satisfaction problems
We make a number of contributions to the study of the Quantified Constraint Satisfaction Problem (QCSP). The QCSP is an extension of the constraint satisfaction problem that can b...
Ian P. Gent, Peter Nightingale, Andrew G. D. Rowle...