Sciweavers

1213 search results - page 155 / 243
» Traceability for System Families
Sort
View
IACR
2011
133views more  IACR 2011»
12 years 9 months ago
Compact McEliece keys based on Quasi-Dyadic Srivastava codes
The McEliece cryptosystem is one of the few systems to be considered secure against attacks by Quantum computers. The original scheme is built upon Goppa codes and produces very l...
Edoardo Persichetti
AICT
2006
IEEE
100views Communications» more  AICT 2006»
14 years 4 months ago
A Concept Model for Computer-based Spoken Language Tests
Spoken language education plays an important role in modern language courses. Computer-based spoken language test systems provide a convenient, efficient and reliable approach to ...
Yijian Wu, Wenyun Zhao, Xin Peng, Yunjiao Xue
WG
2004
Springer
14 years 3 months ago
Collective Tree Spanners and Routing in AT-free Related Graphs
In this paper we study collective additive tree spanners for families of graphs that either contain or are contained in AT-free graphs. We say that a graph G = (V, E) admits a sys...
Feodor F. Dragan, Chenyu Yan, Derek G. Corneil
ATAL
2003
Springer
14 years 3 months ago
Multiagent diffusion and distributed optimization
Distributed problem solving by a multiagent system represents a promising approach to solving complex computational problems. However, many multiagent systems require certain degr...
Kwok Ching Tsui, Jiming Liu
AAAI
2000
13 years 11 months ago
Non-Deterministic Social Laws
The paper generalizes the notion of a social law, the foundation of the theory of artificial social systems developed for coordinating Multi-Agent Systems. In an artificial social...
Michael H. Coen