Sciweavers

1013 search results - page 124 / 203
» A Subexponential Algorithm for Abstract Optimization Problem...
Sort
View
ISPEC
2010
Springer
15 years 2 months ago
On Fast and Approximate Attack Tree Computations
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...
Aivo Jürgenson, Jan Willemson
ISSAC
1992
Springer
114views Mathematics» more  ISSAC 1992»
15 years 1 months ago
Parallel Lattice Basis Reduction
Abstract. Lattice basis reduction is an important problem in geometry of numbers with applications in combinatorial optimization, computer algebra, and cryptography. The well-known...
Gilles Villard
AI
2003
Springer
15 years 3 months ago
Scaling and Probabilistic Smoothing: Dynamic Local Search for Unweighted MAX-SAT
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...
Dave A. D. Tompkins, Holger H. Hoos
ICC
2007
IEEE
141views Communications» more  ICC 2007»
15 years 4 months ago
A Decomposition-Based Low-Complexity Scheduling Scheme for Power Minimization under Delay Constraints in Time-Varying Uplink Cha
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 ...
Hojoong Kwon, Byeong Gi Lee
INFOCOM
2012
IEEE
13 years 8 days ago
Towards energy-fairness in asynchronous duty-cycling sensor networks
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. ...
Zhenjiang Li, Mo Li, Yunhao Liu