892 search results - page 93 / 179 » Strategies in sentential reasoning |
115
click to vote
ATAL
2011
Springer
14 years 25 days ago
2011
Springer
We develop an algorithm for opponent modeling in large extensive-form games of imperfect information. It works by observing the opponent’s action frequencies and building an opp...
97
Voted
DDECS
2007
IEEE
15 years 7 months ago
2007
IEEE
—An efficient on-chip infrastructure for memory test and repair is crucial to enhance yield and availability of SoCs. A commonly used repair strategy is to equip memories with sp...
126
click to vote
TACAS
2007
Springer
15 years 7 months ago
2007
Springer
We study and provide efficient algorithms for multi-objective model checking problems for Markov Decision Processes (MDPs). Given an MDP, M, and given multiple linear-time (ω-regu...
100
click to vote
DAC
2005
ACM
16 years 1 months ago
2005
ACM
SAT (Boolean satisfiability) has become the primary Boolean reasoning engine for many EDA applications, so the efficiency of SAT solving is of great practical importance. Recently...
CADE
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. In functional programming languages the use of infinite structures is common practice. For total correctness of programs dealing with infinite structures one must guarant...