Sciweavers

4192 search results - page 55 / 839
» Efficient testing of groups
Sort
View
IJAC
2008
97views more  IJAC 2008»
13 years 10 months ago
Random Generation of Finitely Generated Subgroups of a Free Group
We give an efficient algorithm to randomly generate finitely generated subgroups of a given size, in a finite rank free group. Here, the size of a subgroup is the number of vertic...
Frédérique Bassino, Cyril Nicaud, Pa...
PERCOM
2007
ACM
14 years 10 months ago
A three round authenticated group key agreement protocol for ad hoc networks
Group Key Agreement (GKA) protocols enable the participants to derive a key based on each one's contribution over a public network without any central authority. They also pr...
Daniel Augot, Raghav Bhaskar, Valérie Issarny, Da...
FM
2006
Springer
133views Formal Methods» more  FM 2006»
14 years 1 months ago
Enforcer - Efficient Failure Injection
Non-determinism of the thread schedule is a well-known problem in concurrent programming. However, other sources of non-determinism exist which cannot be controlled by an applicati...
Cyrille Artho, Armin Biere, Shinichi Honiden
VLSID
2001
IEEE
164views VLSI» more  VLSID 2001»
14 years 10 months ago
An Efficient Parallel Transparent Bist Method For Multiple Embedded Memory Buffers
In this paper, we propose a new transparent built-in self-test ( TBIST ) method to test multiple embedded memory arrays with various sizes in parallel. First, a new transparent tes...
Der-Cheng Huang, Wen-Ben Jone, Sunil R. Das
ATAL
2009
Springer
14 years 4 months ago
Using opponent models for efficient negotiation
d Abstract) Koen Hindriks Man-Machine Interaction Group Delft University of Technology Mekelweg 4, Delft, The Netherlands
Koen V. Hindriks, Catholijn M. Jonker, Dmytro Tykh...