Sciweavers

33 search results - page 2 / 7
» Calculating Polynomial Runtime Properties
Sort
View
ANTSW
2010
Springer
13 years 5 months ago
Theoretical Properties of Two ACO Approaches for the Traveling Salesman Problem
Ant colony optimization (ACO) has been widely used for different combinatorial optimization problems. In this paper, we investigate ACO algorithms with respect to their runtime beh...
Timo Kötzing, Frank Neumann, Heiko Rögli...
ISCAS
2007
IEEE
133views Hardware» more  ISCAS 2007»
14 years 1 months ago
Volterra Analysis Using Chebyshev Series
— The paper presents a new approach to the Volterra analysis of analog circuits. This kind of analysis is widely used for the calculation of distortion and intermodulation produc...
Ioannis Sarkas, Dimitrios Mavridis, Michail Papami...
CSFW
2006
IEEE
14 years 1 months ago
Simulation-Based Security with Inexhaustible Interactive Turing Machines
Recently, there has been much interest in extending models for simulation-based security in such a way that the runtime of protocols may depend on the length of their input. Findi...
Ralf Küsters
ICLP
2010
Springer
13 years 5 months ago
A Framework for Verification and Debugging of Resource Usage Properties: Resource Usage Verification
We present a framework for (static) verification of general resource usage program properties. The framework extends the criteria of correctness as the conformance of a program to ...
Pedro López-García, Luthfi Darmawan,...
QSIC
2007
IEEE
14 years 1 months ago
Towards Automatic Measurement of Probabilistic Processes
In this paper we propose a metric for finite processes in a probabilistic extension of CSP. The kernel of the metric corresponds to trace equivalence and most of the operators in...
Lin Song, Yuxin Deng, Xiaojuan Cai