CORR
2008
Springer
14 years 16 days ago
2008
Springer
A recent study characterizing failures in computer networks shows that transient single element (node/link) failures are the dominant failures in large communication networks like...
CORR
2008
Springer
14 years 16 days ago
2008
Springer
We propose abc-boost (adaptive base class boost) for multi-class classification and present abc-mart, an implementation of abcboost, based on the multinomial logit model. The key ...
CORR
2008
Springer
14 years 16 days ago
2008
Springer
In this pair of papers (Part I and Part II in this issue), we investigate the issue of power control and subcarrier assignment in a sectorized two-cell downlink OFDMA system impair...
CORR
2008
Springer
14 years 16 days ago
2008
Springer
Resolution refinements called w-resolution trees with lemmas (WRTL) and with input lemmas (WRTI) are introduced. Dag-like resolution is equivalent to both WRTL and WRTI when there...
CORR
2008
Springer
14 years 16 days ago
2008
Springer
In connection with machine arithmetic, we are interested in systems of constraints of the form x + k y + k . Over integers, the satisfiability problem for such systems is polynomi...
CORR
2008
Springer
14 years 16 days ago
2008
Springer
CORR
2008
Springer
14 years 16 days ago
2008
Springer
Existential fixed point logic (EFPL) is a natural fit for some applications, and the purpose of this talk is to attract attention to EFPL. The logic is also interesting in its own ...
CORR
2008
Springer
14 years 16 days ago
2008
Springer
Recent work has shown how information theory extends conventional full-rationality game theory to allow bounded rational agents. The associated mathematical framework can be used ...
CORR
2008
Springer
14 years 16 days ago
2008
Springer
act state machines. (To make that discussion self-contained, we include a summary of this material before the modifications.) Fortunately, only rather minor modifications are neede...
CORR
2008
Springer
14 years 16 days ago
2008
Springer
People usually regard algorithms as more abstract than the programs that implement them. The natural way to formalize this idea is that algorithms are equivalence classes of progra...