Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Ondrej Cepek"'
Publikováno v:
Theoretical Computer Science. 856:68-74
Given a CNF formula $\Phi$ with clauses $C_1,\ldots,C_m$ and variables $V=\{x_1,\ldots,x_n\}$, a truth assignment $a:V\rightarrow\{0,1\}$ of $\Phi$ leads to a clause sequence $\sigma_\Phi(a)=(C_1(a),\ldots,C_m(a))\in\{0,1\}^m$ where $C_i(a) = 1$ if c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::abb9eec75785cde6c37554b21b93831d
https://doi.org/10.1016/j.tcs.2020.12.021
https://doi.org/10.1016/j.tcs.2020.12.021
Autor:
Ondrej Cepek
Publikováno v:
The International FLAIRS Conference Proceedings. 35
A switch-list representation (SLR) of a Boolean function is a compressed truth table representation of a Boolean function in which only the function value of the first row in the truth table and an ordered list of switches are stored. A switch is a B
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3a63c6a5aa8dc943540d93a2f899c927
https://doi.org/10.32473/flairs.v35i.130700
https://doi.org/10.32473/flairs.v35i.130700
A discrete function of $n$ variables is a mapping $g : X_1 \times \ldots \times X_n \rightarrow A$, where $X_1, \ldots, X_n$, and $A$ are arbitrary finite sets. Function $g$ is called {\em separable} if there exist $n$ functions $g_i : X_i \rightarro
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f4438371efae203220bc5256f2b78995
Autor:
Ondrej Cepek, Roman Barták
Publikováno v:
ICTAI
Precedence constraints specify that an activity must finish before another activity starts and hence such constraints play a crucial role in planning and scheduling problems. Many real-life problems also include dependency constraints expressing logi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3a65bab47b3294b53e40dd3b119df423
https://doi.org/10.1142/s0218213008003856
https://doi.org/10.1142/s0218213008003856
Publikováno v:
Principles and Practice of Constraint Programming – CP 2004 ISBN: 9783540232414
CP
ResearcherID
CP
ResearcherID
Scheduling is one of the most successful application areas of constraint programming mainly thanks to special global constraints designed to model resource restrictions. Among these global constraints, edge-finding filtering algorithm for unary resou
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a47b840210d4fcf3c9f6d2abe611490d
https://doi.org/10.1007/978-3-540-30201-8_8
https://doi.org/10.1007/978-3-540-30201-8_8
Autor:
Roman Bartak, Ondrej Cepek
Publikováno v:
2006 18th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'06); 2006, p416-426, 11p
Autor:
Kazuhisa Makino, Peter L. Hammer, Alexander Kogan, Ondrej Cepek, Endre Boros, Bert Randerath, Bruno Simeone, Ewald Speckenmeyer
Publikováno v:
Scopus-Elsevier
Abstract In this note we present a formulation of two related combinatorial embedding problems concerning level graphs in terms of CNF-formulas. The first problem is known as level planar embedding and the second as crossing-minimization-problem.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::eb4fa6a3b64cf50ee2ed02d21845fefc
http://www.scopus.com/inward/record.url?eid=2-s2.0-26444480508&partnerID=MN8TOARS
http://www.scopus.com/inward/record.url?eid=2-s2.0-26444480508&partnerID=MN8TOARS