Sciweavers

3373 search results - page 142 / 675
» Naturalistic Decision Making
Sort
View
111
Voted
ENTCS
2006
161views more  ENTCS 2006»
15 years 25 days ago
Tool Building Requirements for an API to First-Order Solvers
Effective formal verification tools require that robust implementations of automatic procedures for first-order logic and satisfiability modulo theories be integrated into express...
Jim Grundy, Thomas F. Melham, Sava Krstic, Sean Mc...
95
Voted
TPHOL
2005
IEEE
15 years 6 months ago
Shallow Lazy Proofs
We show that delaying fully-expansive proof reconstruction for non-interactive decision procedures can result in a more efficient workflow. In contrast with earlier work, our appr...
Hasan Amjad
123
Voted
ATAL
2008
Springer
15 years 2 months ago
Multi agent based simulation of transport chains
An agent-based tool for micro-level simulation of transport chains (TAPAS) is described. It is more powerful than traditional approaches as it is able to capture the interactions ...
Paul Davidsson, Johan Holmgren, Jan A. Persson, Li...
89
Voted
CORR
2002
Springer
94views Education» more  CORR 2002»
15 years 19 days ago
Self-Optimizing and Pareto-Optimal Policies in General Environments based on Bayes-Mixtures
The problem of making sequential decisions in unknown probabilistic environments is studied. In cycle t action yt results in perception xt and reward rt, where all quantities in g...
Marcus Hutter
104
Voted
TOC
2010
123views Management» more  TOC 2010»
14 years 7 months ago
Rounds vs. Queries Tradeoff in Noisy Computation
: We show that a noisy parallel decision tree making O(n) queries needs (log n) rounds to compute OR of n bits. This answers a question of Newman [IEEE Conference on Computational ...
Navin Goyal, Michael Saks