Sciweavers

157 search results - page 31 / 32
» SLIDE: A Useful Special Case of the CARDPATH Constraint
Sort
View
MP
2002
143views more  MP 2002»
13 years 5 months ago
Extending Dantzig's bound to the bounded multiple-class binary Knapsack problem
The bounded multiple-class binary knapsack problem is a variant of the knapsack problem where the items are partitioned into classes and the item weights in each class are a multip...
François Vanderbeck
INFOCOM
2010
IEEE
13 years 3 months ago
An Axiomatic Theory of Fairness in Network Resource Allocation
We present a set of five axioms for fairness measures in resource allocation. A family of fairness measures satisfying the axioms is constructed. Well-known notions such as -fairne...
Tian Lan, David Kao, Mung Chiang, Ashutosh Sabharw...
CASES
2006
ACM
13 years 9 months ago
Cost-efficient soft error protection for embedded microprocessors
Device scaling trends dramatically increase the susceptibility of microprocessors to soft errors. Further, mounting demand for embedded microprocessors in a wide array of safety c...
Jason A. Blome, Shantanu Gupta, Shuguang Feng, Sco...
CASES
2007
ACM
13 years 9 months ago
Rethinking custom ISE identification: a new processor-agnostic method
The last decade has witnessed the emergence of the Application Specific Instruction-set Processor (ASIP) as a viable platform for embedded systems. Extensible ASIPs allow the user...
Ajay K. Verma, Philip Brisk, Paolo Ienne
ESA
2010
Springer
246views Algorithms» more  ESA 2010»
13 years 6 months ago
Estimating the Average of a Lipschitz-Continuous Function from One Sample
We study the problem of estimating the average of a Lipschitz continuous function f defined over a metric space, by querying f at only a single point. More specifically, we explore...
Abhimanyu Das, David Kempe