9572 search results - page 230 / 1915 » Cover Algorithms and Their Combination |
130
click to vote
SODA
2000
ACM
15 years 7 months ago
2000
ACM
This presentation covers several sections of the paper by Berkman, Parnas and Sgall for the Advanced Topics in Network Security seminar. Ben-Gurion University of the Negev, fall 2...
138
click to vote
ACL
1993
15 years 7 months ago
1993
We show that feature logic extended by functional uncertainty is decidable, even if one admits cyclic descriptions. We present an algorithm, which solves feature descriptions cont...
159
click to vote
ALGORITHMICA
2010
15 years 6 months ago
2010
Abstract Given an n-point metric (P,d) and an integer k > 0, we consider the problem of covering P by k balls so as to minimize the sum of the radii of the balls. We present a r...
137
click to vote
EOR
2000
15 years 6 months ago
2000
A new algorithm called Enhanced Continuous Tabu Search (ECTS) is proposed for the global optimization of multiminima functions. It results from an adaptation of combinatorial Tabu...
135
click to vote
ISCAS
2006
IEEE
16 years 16 days ago
2006
IEEE
— We present analytical formulas for the calculation of the memory requirements for a system using the Complex Logarithmic Number System (CLNS). Certain properties of the CLNS ad...