1252 search results - page 25 / 251 » Minimizing Learned Clauses |
TARK
2007
Springer
15 years 3 months ago
2007
Springer
We relate regret minimization to various online learning tasks, and most notable option pricing.
CP
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. The global cumulative constraint was proposed for modelling cumulative resources in scheduling problems for finite domain (FD) propagation. Since that time a great deal ...
FC
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Suppose Alice and Bob are two entities (e.g. agents, organizations, etc.) that wish to negotiate a contract. A contract consists of several clauses, and each party has ce...
CONCUR
2006
Springer
15 years 1 months ago
2006
Springer
Boolean programs with recursion are convenient abstractions of sequential imperative programs, and can be represented as recursive state machines (RSMs) or pushdown automata. Motiv...
STOC
2006
ACM
15 years 10 months ago
2006
ACM
Producing a small DNF expression consistent with given data is a classical problem in computer science that occurs in a number of forms and has numerous applications. We consider ...