Sciweavers

9842 search results - page 1951 / 1969
» Problem complexity
Sort
View
126
Voted
CN
2000
128views more  CN 2000»
15 years 3 months ago
The Network Workbench: network simulation software for academic investigation of Internet concepts
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...
J. Mark Pullen
170
Voted
SCP
2000
119views more  SCP 2000»
15 years 3 months ago
Automated compositional Markov chain generation for a plain-old telephone system
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...
Holger Hermanns, Joost-Pieter Katoen
156
Voted
AC
1998
Springer
15 years 3 months ago
Cellular Automata Models of Self-Replicating Systems
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...
James A. Reggia, Hui-Hsien Chou, Jason D. Lohn
131
Voted
IJON
2002
104views more  IJON 2002»
15 years 3 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
159
Voted
GEOINFORMATICA
1998
125views more  GEOINFORMATICA 1998»
15 years 3 months ago
Computational Perspectives on Map Generalization
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...
Robert Weibel, Christopher B. Jones
« Prev « First page 1951 / 1969 Last » Next »