Sciweavers

113 search results - page 12 / 23
» On the expected value of the minimum assignment
Sort
View
CAV
2010
Springer
190views Hardware» more  CAV 2010»
15 years 1 months ago
Measuring and Synthesizing Systems in Probabilistic Environments
Often one has a preference order among the different systems that satisfy a given specification. Under a probabilistic assumption about the possible inputs, such a preference order...
Krishnendu Chatterjee, Thomas A. Henzinger, Barbar...
69
Voted
KDD
2005
ACM
107views Data Mining» more  KDD 2005»
15 years 3 months ago
Predicting the product purchase patterns of corporate customers
This paper describes TIPPPS (Time Interleaved Product Purchase Prediction System), which analyses billing data of corporate customers in a large telecommunications company in orde...
Bhavani Raskutti, Alan Herschtal
96
Voted
AAAI
2008
14 years 12 months ago
Hybrid Constraint Tightening for Solving Hybrid Scheduling Problems
Hybrid Scheduling Problems (HSPs) contain both temporal and finite-domain variables, as well as constraints between them. A hybrid constraint over temporal and finite-domain varia...
James C. Boerkoel Jr., Edmund H. Durfee
CGO
2004
IEEE
15 years 1 months ago
Software-Controlled Operand-Gating
Operand gating is a technique for improving processor energy efficiency by gating off sections of the data path that are unneeded by short-precision (narrow) operands. A method fo...
Ramon Canal, Antonio González, James E. Smi...
DM
2008
72views more  DM 2008»
14 years 9 months ago
(p, 1)-Total labelling of graphs
A (p, 1)-total labelling of a graph G is an assignment of integers to V (G) E(G) such that: (i) any two adjacent vertices of G receive distinct integers, (ii) any two adjacent ed...
Frédéric Havet, Min-Li Yu