Sciweavers

344 search results - page 10 / 69
» Optimization problems from feature testing of communication ...
Sort
View
CRYPTO
2008
Springer
165views Cryptology» more  CRYPTO 2008»
15 years 1 months ago
Efficient Secure Linear Algebra in the Presence of Covert or Computationally Unbounded Adversaries
In this work we study the design of secure protocols for linear algebra problems. All current solutions to the problem are either inefficient in terms of communication complexity o...
Payman Mohassel, Enav Weinreb
ISSRE
2005
IEEE
15 years 5 months ago
Testing Web Services by XML Perturbation
The eXtensible Markup Language (XML) is widely used to transmit data across the Internet. XML schemas are used to define the syntax of XML messages. XML-based applications can re...
Wuzhi Xu, Jeff Offutt, Juan Luo
FORTE
1996
15 years 1 months ago
Applications of Fair Testing
In this paper we present the application of the fair testing pre-order, introduced in a previous paper, to the speci cation and analysis of distributed systems. This pre-order com...
Ed Brinksma, Arend Rensink, Walter Vogler
ATAL
2006
Springer
15 years 3 months ago
MDPOP: faithful distributed implementation of efficient social choice problems
We model social choice problems in which self interested agents with private utility functions have to agree on values for a set of variables subject to side constraints. The goal...
Adrian Petcu, Boi Faltings, David C. Parkes
TCAD
2002
110views more  TCAD 2002»
14 years 11 months ago
A constructive genetic algorithm for gate matrix layout problems
This paper describes an application of a Constructive Genetic Algorithm (CGA) to the Gate Matrix Layout Problem (GMLP). The GMLP happens in very large scale integration (VLSI) desi...
Alexandre César Muniz de Oliveira, Luiz Ant...