9842 search results - page 1951 / 1969 » Problem complexity |
CN
2000
14 years 11 months ago
2000
Simulation offers significant advantages as a basis for academic projects in computer networking. many unimportant details can be abstracted away, and also because simulations can...
127
click to vote
SCP
2000
14 years 11 months ago
2000
Obtaining performance models, like Markov chains and queueing networks, for systems of significant complexity and magnitude is a difficult task that is usually tackled using human...
112
click to vote
AC
1998
Springer
14 years 11 months ago
1998
Springer
Abstract: Since von Neumann's seminal work around 1950, computer scientists and others have studied the algorithms needed to support self-replicating systems. Much of this wor...
IJON
2002
14 years 11 months ago
2002
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...
116
click to vote
GEOINFORMATICA
1998
14 years 11 months ago
1998
ally related entity types, or classes, into higher level, more abstract types, as part of a hierarchical classi®cation scheme. graphy, generalization retains the notion of abstrac...