1686 search results - page 169 / 338 » Programs as polygraphs: computability and complexity |
135
click to vote
AAMAS
2010
Springer
15 years 3 months ago
2010
Springer
POMDPs and their decentralized multiagent counterparts, DEC-POMDPs, offer a rich framework for sequential decision making under uncertainty. Their computational complexity, howeve...
118
click to vote
TCSB
2008
15 years 3 months ago
2008
Abstract. Software systems nowadays are becoming increasingly complex and vulnerable to all sorts of failures and attacks. There is a rising need for robust self-repairing systems ...
247
Voted
Book
"This book has evolved from materials used in an undergraduate course intended for final year undergraduate students whose background includes at least one year's experie...
137
Voted
SIGCSE
2000
ACM
15 years 8 months ago
2000
ACM
Being exposed to well-written code is a valuable experience for students -- especially when the code is larger or more complex than they are currently capable of writing. In addit...
154
Voted
GECCO
2007
Springer
15 years 7 months ago
2007
Springer
This paper introduces a function that increases the amount of neutrality (inactive code in Genetic Programming) for the Artificial Ant Problem. The objective of this approach is t...