Sciweavers

1252 search results - page 32 / 251
» Minimizing Learned Clauses
Sort
View
74
Voted
ECTEL
2007
Springer
15 years 3 months ago
An Information Architecture for Validating Courseware
Abstract. Courseware validation should locate Learning Objects inconsistent with the courseware instructional design being used. In order for validation to take place it is necessa...
Mark Melia, Claus Pahl
OSDI
2008
ACM
15 years 10 months ago
From Optimization to Regret Minimization and Back Again
Internet routing is mostly based on static information-it's dynamicity is limited to reacting to changes in topology. Adaptive performance-based routing decisions would not o...
Ioannis C. Avramopoulos, Jennifer Rexford, Robert ...
90
Voted
COLT
2008
Springer
14 years 11 months ago
More Efficient Internal-Regret-Minimizing Algorithms
Standard no-internal-regret (NIR) algorithms compute a fixed point of a matrix, and hence typically require O(n3 ) run time per round of learning, where n is the dimensionality of...
Amy R. Greenwald, Zheng Li, Warren Schudy
AAAI
1993
14 years 11 months ago
Finding Accurate Frontiers: A Knowledge-Intensive Approach to Relational Learning
learning (EBL) component. In this paper we provide a brief review of FOIL and FOCL, then discuss how operationalizing a domain theory can adversely affect the accuracy of a learned...
Michael J. Pazzani, Clifford Brunk
CADE
2001
Springer
15 years 10 months ago
NP-Completeness of Refutability by Literal-Once Resolution
A boolean formula in conjunctive normal form (CNF) F is refuted by literal?once resolution if the empty clause is inferred from F by resolving on each literal of F at most once. Li...
Stefan Szeider