Zobrazeno 1 - 10
of 16
pro vyhledávání: '"Petr Vilím"'
Autor:
Petr Vilímek
Publikováno v:
Czech Journal of International Relations, Vol 44, Iss 2 (2009)
Jan Růžička – Kryštof Kozák a kolektiv: Úpadek amerického federalismu? Posilování federální vlády na prahu 21. století. 1. vydání. Praha: Karolinum, 2008, 160 stran, ISBN 978-80-246-1503-5.
Externí odkaz:
https://doaj.org/article/c907cc4241844a3393166943b86da4eb
Autor:
Petr Suchý, Petr Vilímek
Publikováno v:
Czech Journal of International Relations, Vol 44, Iss 1 (2009)
The article outlines the main theoretical models of nuclear proliferation and the motives that are driving states to obtain nuclear weapons. It also focuses on theoretical concepts dealing with variants and alternatives of the future fate of nuclear
Externí odkaz:
https://doaj.org/article/2bda20bbc35a4590a7dbf38d354a1f55
Publikováno v:
Constraints. 23:210-250
IBM ILOG CP Optimizer is a generic CP-based system to model and solve scheduling problems. It provides an algebraic language with simple mathematical concepts to capture the temporal dimension of scheduling problems in a combinatorial optimization fr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1c76a5b6b86f53812aeb3e9378e968a4
https://doi.org/10.1007/s10601-018-9281-x
https://doi.org/10.1007/s10601-018-9281-x
Publikováno v:
Constraints. 10:403-425
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 and not-first/not-last are the most
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c4826ccf61df2610dcb36e4b55ccb243
https://doi.org/10.1007/s10601-005-2814-0
https://doi.org/10.1007/s10601-005-2814-0
Publikováno v:
Algebraic Modeling Systems ISBN: 9783642235917
IBM ILOG CP Optimizer (CPO) provides a scheduling language supported by a robust and efficient automatic search. This paper summes up the major language constructs and shed some lights on their propagations. Among the main constructs it introduces th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7280f8256544d366a89fced46486a650
https://doi.org/10.1007/978-3-642-23592-4_6
https://doi.org/10.1007/978-3-642-23592-4_6
Autor:
Petr Vilím
Publikováno v:
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems ISBN: 9783642213106
CPAIOR
CPAIOR
Edge Finding filtering algorithm is one of the reasons why Constraint Programming is a successful approach in the scheduling domain. However edge finding for cumulative resources was never as successful as edge finding for disjunctive resources. This
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::312a446bea49746fb71ac990d8145a64
https://doi.org/10.1007/978-3-642-21311-3_22
https://doi.org/10.1007/978-3-642-21311-3_22
Publikováno v:
Principles and Practice of Constraint Programming – CP 2011 ISBN: 9783642237850
CP
CP
In this paper, we describe a Constraint Programming (CP) route finding application for a container transportation company. Mathematically, this amounts to finding the k shortest paths in a directed graph. However the nature of the business constraint
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::537e096c1c19a32aa5ee44b39a09400a
https://doi.org/10.1007/978-3-642-23786-7_6
https://doi.org/10.1007/978-3-642-23786-7_6
Autor:
Petr Vilím
Publikováno v:
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems ISBN: 9783642019289
CPAIOR
CPAIOR
In scheduling using constraint programming we usually reason only about possible start times and end times of activities and remove those which are recognized as unfeasible. However often in practice there are more variables in play: variable duratio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b070b5d09d0151371588884dc4b00af4
https://doi.org/10.1007/978-3-642-01929-6_22
https://doi.org/10.1007/978-3-642-01929-6_22
Edge Finding Filtering Algorithm for Discrete Cumulative Resources in ${\mathcal O}(kn {\rm log} n)$
Autor:
Petr Vilím
Publikováno v:
Principles and Practice of Constraint Programming-CP 2009 ISBN: 9783642042430
This paper presents new Edge Finding algorithm for discrete cumulative resources, i.e. resources which can process several activities simultaneously up to some maximal capacity C. The algorithm has better time complexity than the current version of t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::eb3f98279e58c39a0c23c250c7e5eb42
https://doi.org/10.1007/978-3-642-04244-7_62
https://doi.org/10.1007/978-3-642-04244-7_62
Autor:
Petr Vilím
Publikováno v:
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems ISBN: 9783540261520
CPAIOR
CPAIOR
Integration of explanations into a CSP solver is a technique addressing difficult question “why my problem has no solution”. Moreover, explanations together with advanced search methods like directed backjumping can effectively cut off parts of t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::181e86152cea8eefde7e87f8ef5f0657
https://doi.org/10.1007/11493853_29
https://doi.org/10.1007/11493853_29