1615 search results - page 178 / 323 » Computer science and decision theory |
148
click to vote
STACS
2010
Springer
15 years 11 months ago
2010
Springer
In 2000 Alber et al. [SWAT 2000 ] obtained the ļ¬rst parameterized subexponential algorithm on undirected planar graphs by showing that k-DOMINATING SET is solvable in time 2O( ā...
155
Voted
CADE
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. The problem of computing Craig interpolants in SMT has recently received a lot of interest, mainly for its applications in formal veriļ¬cation. Eļ¬cient algorithms for ...
137
click to vote
ICML
1998
IEEE
16 years 5 months ago
1998
IEEE
tion Learning about Temporally Abstract Actions Richard S. Sutton Department of Computer Science University of Massachusetts Amherst, MA 01003-4610 rich@cs.umass.edu Doina Precup D...
130
click to vote
CHI
2007
ACM
16 years 5 months ago
2007
ACM
A theoretical framework for assessing the attractiveness of websites based on Adaptive Decision Making theory is introduced. The framework was developed into a questionnaire and u...
163
click to vote
KBSE
2005
IEEE
15 years 10 months ago
2005
IEEE
In test generation based on model-checking, white-box test criteria are represented as trap conditions written in a temporal logic. A model checker is used to refute trap conditio...