Sciweavers

9842 search results - page 362 / 1969
» Problem complexity
Sort
View
IRI
2006
IEEE
16 years 27 days ago
Environment as support for simplification, reuse and integration of processes in spatial MAS
The development of solutions to complex problems requires finding answers to several questions which are obstacles on the road leading to the solution. To perpetuate progress, the...
Denis Payet, Rémy Courdier, Nicolas S&eacut...
STOC
2005
ACM
113views Algorithms» more  STOC 2005»
16 years 7 months ago
Efficient testing of groups
We construct an efficient probabilistic algorithm that, given a finite set with a binary operation, tests if it is an abelian group. The distance used is an analogue of the edit d...
Katalin Friedl, Gábor Ivanyos, Miklos Santh...
TPDS
2008
125views more  TPDS 2008»
15 years 6 months ago
Computation-Efficient Multicast Key Distribution
Efficient key distribution is an important problem for secure group communications. The communication and storage complexity of multicast key distribution problem has been studied ...
Lihao Xu, Cheng Huang
IWPSE
2003
IEEE
16 years 4 days ago
The Chaos of Software Development
In this paper we present a new perspective on the problem of complexity in software, using sound mathematical concepts from information theory such as Shannon’s Entropy [31]. We...
Ahmed E. Hassan, Richard C. Holt
ICDT
2003
ACM
125views Database» more  ICDT 2003»
16 years 2 days ago
XPath Containment in the Presence of Disjunction, DTDs, and Variables
XPath is a simple language for navigating an XML tree and returning a set of answer nodes. The focus in this paper is on the complexity of the containment problem for various fragm...
Frank Neven, Thomas Schwentick