703 search results - page 133 / 141 » Maintenance scheduling problems as benchmarks for constraint... |
88
Voted
CORR
2010
Springer
14 years 6 months ago
2010
Springer
We investigate optimal routing and scheduling strategies for multi-hop wireless networks with rateless codes. Rateless codes allow each node of the network to accumulate mutual in...
DAC
2004
ACM
15 years 10 months ago
2004
ACM
Current Static Timing Analysis (STA) techniques allow one to verify the timing of a circuit at different process corners which only consider cases where all the supplies are low o...
194
click to vote
CP
2009
Springer
15 years 10 months ago
2009
Springer
Decision tree induction techniques attempt to find small trees that fit a training set of data. This preference for smaller trees, which provides a learning bias, is often justifie...
ICCAD
2002
IEEE
15 years 6 months ago
2002
IEEE
Application-specific instructions can significantly improve the performance, energy, and code size of configurable processors. A common approach used in the design of such instruc...
FROCOS
2009
Springer
15 years 1 months ago
2009
Springer
In recent years, the problem of extracting a MUS (Minimal Unsatisfiable Subformula) from an unsatisfiable CNF has received much attention. Indeed, when a Boolean formula is proved ...