1127 search results - page 194 / 226 » Theory Extension in ACL2(r) |
129
Voted
AAAI
2000
15 years 2 months ago
2000
Answer-set programming (ASP) has emerged recently as a viable programming paradigm well attuned to search problems in AI, constraint satisfaction and combinatorics. Propositional ...
111
Voted
JACM
2007
15 years 16 days ago
2007
abstraction of imperfect information games ANDREW GILPIN and TUOMAS SANDHOLM Computer Science Department Carnegie Mellon University Pittsburgh, PA, USA Finding an equilibrium of an...
124
click to vote
COMPUTING
2008
15 years 22 days ago
2008
Generalizing the approach of a previous work [15] the authors present multilevel preconditioners for three-dimensional (3D) elliptic problems discretized by a family of Rannacher ...
111
Voted
ADCM
1998
15 years 10 days ago
1998
Two e cient methods for solving generalized Lyapunov equations and their implementations in FORTRAN 77 are presented. The rst one is a generalization of the Bartels{Stewart method...
98
Voted
KDD
1999
ACM
15 years 4 months ago
1999
ACM
Abstract. We propose a data mining model that captures the user navigation behaviour patterns. The user navigation sessions are modelled as a hypertext probabilistic grammar whose ...