8196 search results - page 389 / 1640 » Computational Modeling and Complexity Science |
198
click to vote
ACSC
2006
IEEE
16 years 25 days ago
2006
IEEE
Trust networks consist of transitive trust relationships between people, organisations and software agents connected through a medium for communication and interaction. By formali...
161
click to vote
CCA
2000
Springer
15 years 11 months ago
2000
Springer
The Exact Geometric Computing approach requires a zero test for numbers which are built up using standard operations starting with the natural numbers. The uniformity conjecture, ...
170
click to vote
GI
2009
Springer
15 years 4 months ago
2009
Springer
Abstract: In biomolecular simulations intensive computations are spent in nonbonded interactions kernels, i.e., electrostatic interactions. Therefore this part can be considered as...
158
click to vote
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
We show that the combinatorial complexity of the union of n infinite cylinders in R3 , having arbitrary radii, is O(n2+ε ), for any ε > 0; the bound is almost tight in the w...
174
click to vote
SOFSEM
2007
Springer
16 years 26 days ago
2007
Springer
The requirements for a system are often specified as textual use cases. Although they are written in natural language, the simple and uniform sentence structure used makes automate...