1149 search results - page 117 / 230 » What Are Iteration Theories |
GLOBECOM
2006
IEEE
14 years 2 months ago
2006
IEEE
— There has been a significant amount of work analyzing the Internet AS (Autonomous System)-level topology which gives rise to a number of topology models. Although each of thes...
ACMSE
2006
ACM
14 years 2 months ago
2006
ACM
Classic results in the theory of regular languages show that the problem of converting an NFA (nondeterministic finite automaton) into a minimal equivalent NFA is NP-hard, even f...
CONTEXT
2005
Springer
14 years 2 months ago
2005
Springer
Most direct reference theorists believe that ‘I’ is a pure indexical. This means that when ‘I’ is uttered, it contributes with the speaker to what is said. But, from some c...
GECCO
2005
Springer
2005
Springer
Probing for limits to building block mixing with a tunably-difficult problem for genetic programming
14 years 2 months ago
This paper describes a tunably-difficult problem for genetic programming (GP) that probes for limits to building block mixing and assembly. The existence of such a problem can be ...
HT
2004
ACM
14 years 2 months ago
2004
ACM
While much attention is paid to defining and examining interactions with links, little is paid to the front end: the anchor. We examine what an anchor is, describe six anchor prop...