Sciweavers

2626 search results - page 520 / 526
» The complexity of stochastic sequences
Sort
View
IJON
2002
104views more  IJON 2002»
13 years 8 months ago
Power and the limits of reactive agents
In this paper I will show how reactive agents can solve relatively complex tasks without requiring any internal state and I will demonstrate that this is due to their ability to c...
Stefano Nolfi
CGA
1999
13 years 8 months ago
Visualizing Large Telecommunication Data Sets
displays to abstract network data and let users interactwithit.Wehaveimplementedafull-scaleSwift3D prototype, which generated the examples we present here. Swift-3D We developed Sw...
Eleftherios Koutsofios, Stephen C. North, Daniel A...
MOC
1998
93views more  MOC 1998»
13 years 8 months ago
Computing ray class groups, conductors and discriminants
We use the algorithmic computation of exact sequences of Abelian groups to compute the complete structure of (ZK /m)∗ for an ideal m of a number field K, as well as ray class gr...
Henri Cohen, Francisco Diaz y Diaz, Michel Olivier
PE
2002
Springer
128views Optimization» more  PE 2002»
13 years 8 months ago
Response times in a two-node queueing network with feedback
The study presented in this paper is motivated by the performance analysis of response times in distributed information systems, where transactions are handled by iterative server...
Robert D. van der Mei, Bart Gijsen, N. in't Veld, ...
TC
1998
13 years 8 months ago
Abstraction Techniques for Validation Coverage Analysis and Test Generation
ion Techniques for Validation Coverage Analysis and Test Generation Dinos Moundanos, Jacob A. Abraham, Fellow, IEEE, and Yatin V. Hoskote —The enormous state spaces which must be...
Dinos Moundanos, Jacob A. Abraham, Yatin Vasant Ho...