2354 search results - page 133 / 471 » A Common-Sense Theory of Time |
SPAA
2005
ACM
14 years 1 months ago
2005
ACM
A weighted undirected network is ∆ growth-bounded if the number of nodes at distance 2r around any given node is at most ∆ times the number of nodes at distance r around the n...
GECCO
2005
Springer
14 years 1 months ago
2005
Springer
Evaluating GP schema in context is considered to be a complex, and, at times impossible, task. The tightly linked nodes of a GP tree is the main reason behind its complexity. This...
GECCO
2005
Springer
14 years 1 months ago
2005
Springer
Many real-world problems are multi-objective optimization problems and evolutionary algorithms are quite successful on such problems. Since the task is to compute or approximate t...
FOCS
2003
IEEE
14 years 1 months ago
2003
IEEE
We give a complexity theoretic classification of homomorphism problems for graphs and, more generally, relational structures obtained by restricting the left hand side structure ...
HICSS
2003
IEEE
14 years 1 months ago
2003
IEEE
In this paper we shall represent strategic planning problems by dynamic decision trees, in which the nodes are projects that can be deferred or postponed for a certain period of t...