612 search results - page 103 / 123 » An Empirical Study of Agent Programs |
111
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
One possible escape from the Gibbard-Satterthwaite theorem is computational complexity. For example, it is NP-hard to compute if the STV rule can be manipulated. However, there is...
211
click to vote
POPL
2001
ACM
16 years 2 months ago
2001
ACM
Secure Safe Ambients (SSA) are a typed variant of Safe Ambients [9], whose type system allows behavioral invariants of ambients to be expressed and verified. The most significant a...
106
click to vote
AIED
2007
Springer
15 years 8 months ago
2007
Springer
SimStudent is a machine-learning agent that learns cognitive skills by demonstration. SimStudent was originally built as a building block for Cognitive Tutor Authoring Tools to hel...
141
click to vote
JMLR
2012
13 years 4 months ago
2012
Grid search and manual search are the most widely used strategies for hyper-parameter optimization. This paper shows empirically and theoretically that randomly chosen trials are ...
104
click to vote
CLIMA
2007
15 years 3 months ago
2007
Abstract. Failures are unavoidable in many circumstances. For example, an agent may fail at some point to perform a task in a dynamic environment. Robust systems typically have mec...