85 search results - page 8 / 17 » On Polynomial Representations of Boolean Functions Related t... |
STACS
2001
Springer
13 years 12 months ago
2001
Springer
Abstract. Ordered binary decision diagrams (OBDDs) nowadays belong to the most common representation types for Boolean functions. Although they allow important operations such as s...
IJCAI
2003
13 years 8 months ago
2003
A longstanding goal in planning research is the ability to generalize plans developed for some set of environments to a new but similar environment, with minimal or no replanning....
MFCS
2004
Springer
14 years 25 days ago
2004
Springer
We study the problem of optimal preemptive scheduling with respect to a general target function. Given n jobs with associated weights and m ≤ n uniformly related machines, one a...
COR
2008
13 years 7 months ago
2008
In this paper, we provide a study of Max-Min Fair (MMF) multicommodity flows and focus on some of their applications to multi-commodity networks. We first present the theoretical ...
ECCC
2007
13 years 7 months ago
2007
The OR-SAT problem asks, given Boolean formulae φ1, . . . , φm each of size at most n, whether at least one of the φi’s is satisfiable. We show that there is no reduction fr...