3229 search results - page 311 / 646 » The Theory of Timed Automata |
131
click to vote
GECCO
2005
Springer
16 years 10 days 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...
217
click to vote
GECCO
2005
Springer
16 years 10 days 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...
188
click to vote
ITRUST
2004
Springer
16 years 5 days ago
2004
Springer
In the literature, the validity of theories or models for trust is usually based on intuition and common sense. Theories and models are not often verified experimentally. The rese...
172
click to vote
FOCS
2003
IEEE
16 years 3 days 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 ...
169
click to vote
HICSS
2003
IEEE
16 years 3 days 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...