Sciweavers

1133 search results - page 160 / 227
» Best Practices in e-Assessment
Sort
View
IJCAI
1997
15 years 7 months ago
Charts, Interaction-free Grammars, and the Compact Representation of Ambiguity
Recently researchers working in the LFG framework have proposed algorithms for taking advantage of the implicit context-free components of a unification grammar [Maxwell and Kapla...
Marc Dymetman
SODA
2000
ACM
114views Algorithms» more  SODA 2000»
15 years 7 months ago
Typical random 3-SAT formulae and the satisfiability threshold
: k-SAT is one of the best known among a wide class of random constraint satisfaction problems believed to exhibit a threshold phenomenon where the control parameter is the ratio, ...
Olivier Dubois, Yacine Boufkhad, Jacques Mandler
AAAI
1990
15 years 7 months ago
Terminological Cycles in KL-ONE-based Knowledge Representation Languages
Cyclic definitions are often prohibited in terminological knowledge representation languages because, from a theoretical point of view, their semantics is not clear and, from a pr...
Franz Baader
AAAI
2010
15 years 7 months ago
Myopic Policies for Budgeted Optimization with Constrained Experiments
Motivated by a real-world problem, we study a novel budgeted optimization problem where the goal is to optimize an unknown function f(x) given a budget. In our setting, it is not ...
Javad Azimi, Xiaoli Fern, Alan Fern, Elizabeth Bur...
ATAL
2010
Springer
15 years 7 months ago
Point-based backup for decentralized POMDPs: complexity and new algorithms
Decentralized POMDPs provide an expressive framework for sequential multi-agent decision making. Despite their high complexity, there has been significant progress in scaling up e...
Akshat Kumar, Shlomo Zilberstein