Sciweavers

1883 search results - page 325 / 377
» Ordered theta graphs
Sort
View
CAISE
2004
Springer
14 years 1 months ago
Simple and Minimum-Cost Satisfiability for Goal Models
Abstract. Goal models have been used in Computer Science in order to represent software requirements, business objectives and design qualities. In previous work we have presented a...
Roberto Sebastiani, Paolo Giorgini, John Mylopoulo...
CRYPTO
2006
Springer
159views Cryptology» more  CRYPTO 2006»
14 years 1 months ago
Asymptotically Optimal Two-Round Perfectly Secure Message Transmission
Abstract. The problem of perfectly secure message transmission concerns two synchronized non-faulty processors sender (S) and receiver (R) that are connected by a synchronous netwo...
Saurabh Agarwal, Ronald Cramer, Robbert de Haan
GECCO
2006
Springer
155views Optimization» more  GECCO 2006»
14 years 1 months ago
Comparison of genetic representation schemes for scheduling soft real-time parallel applications
This paper presents a hybrid technique that combines List Scheduling (LS) with Genetic Algorithms (GA) for constructing non-preemptive schedules for soft real-time parallel applic...
Yoginder S. Dandass, Amit C. Bugde
GECCO
2006
Springer
167views Optimization» more  GECCO 2006»
14 years 1 months ago
Estimating the destructiveness of crossover on binary tree representations
In some cases, evolutionary algorithms represent individuals as typical binary trees with n leaves and n-1 internal nodes. When designing a crossover operator for a particular rep...
Luke Sheneman, James A. Foster
ACSAC
2001
IEEE
14 years 1 months ago
Information Flow Analysis of Component-Structured Applications
Software component technology facilitates the costeffective development of specialized applications. Nevertheless, due to the high number of principals involved in a component-str...
Peter Herrmann