Sciweavers

1149 search results - page 108 / 230
» What Are Iteration Theories
Sort
View
COCO
2007
Springer
106views Algorithms» more  COCO 2007»
14 years 3 months ago
The Complexity of Polynomials and Their Coefficient Functions
We study the link between the complexity of a polynomial and that of its coefficient functions. Valiant’s theory is a good setting for this, and we start by generalizing one of V...
Guillaume Malod
GECCO
2007
Springer
210views Optimization» more  GECCO 2007»
14 years 3 months ago
Markov chain models of bare-bones particle swarm optimizers
We apply a novel theoretical approach to better understand the behaviour of different types of bare-bones PSOs. It avoids many common but unrealistic assumptions often used in an...
Riccardo Poli, William B. Langdon
STACS
2007
Springer
14 years 3 months ago
On the Automatic Analysis of Recursive Security Protocols with XOR
Abstract. In many security protocols, such as group protocols, principals have to perform iterative or recursive computations. We call such protocols recursive protocols. Recently,...
Ralf Küsters, Tomasz Truderung
XPU
2007
Springer
14 years 3 months ago
Up-Front Interaction Design in Agile Development
Abstract. In this paper we address how interaction design and agile development work together, with a focus on the issue of interaction design being done “up-front”, before sof...
Jennifer Ferreira, James Noble, Robert Biddle
CHARME
2005
Springer
120views Hardware» more  CHARME 2005»
14 years 2 months ago
How Thorough Is Thorough Enough?
Abstraction is the key for effectively dealing with the state explosion in model-checking. Unfortunately, finding abstractions which are small and yet enable us to get conclusive ...
Arie Gurfinkel, Marsha Chechik