1013 search results - page 124 / 203 » A Subexponential Algorithm for Abstract Optimization Problem... |
177
click to vote
ISPEC
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. In this paper we address the problem of inefficiency of exact attack tree computations. We propose several implementation-level optimizations and introduce a genetic algo...
187
click to vote
ISSAC
1992
Springer
15 years 10 months ago
1992
Springer
Abstract. Lattice basis reduction is an important problem in geometry of numbers with applications in combinatorial optimization, computer algebra, and cryptography. The well-known...
150
click to vote
AI
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. In this paper, we study the behaviour of the Scaling and Probabilistic Smoothing (SAPS) dynamic local search algorithm on the unweighted MAXSAT problem. MAX-SAT is a conc...
172
click to vote
ICC
2007
IEEE
16 years 15 days ago
2007
IEEE
Abstract— In this paper, we investigate the problem of minimizing the average transmission power of users while guaranteeing the average delay constraints in time-varying uplink ...
223
click to vote
INFOCOM
2012
IEEE
13 years 8 months ago
2012
IEEE
Abstract—In this paper, we investigate the problem of controlling node sleep intervals so as to achieve the min-max energy fairness in asynchronous duty-cycling sensor networks. ...