Search

Your search keyword '"Bartak, Roman"' showing total 147 results
Start Over Author "Bartak, Roman"

Refine your results

more »

more »

more »
147 results on '"Bartak, Roman"'

1. On Automating Video Game Regression Testing by Planning and Learning

Author

Balyo, Tomáš, Youngblood, G. Michael, Dvořák, Filip, Chrpa, Lukáš, and Barták, Roman

Subjects
Computer Science - Human-Computer Interaction, Computer Science - Artificial Intelligence
Abstract

In this paper, we propose a method and workflow for automating regression testing of certain video game aspects using automated planning and incremental action model learning techniques. The basic idea is to use detailed game logs and incremental action model learning techniques to maintain a formal model in the planning domain description language (PDDL) of the gameplay mechanics. The workflow enables efficient cooperation of game developers without any experience with PDDL or other formal systems and a person experienced with PDDL modeling but no game development skills. We describe the method and workflow in general and then demonstrate it on a concrete proof-of-concept example -- a simple role-playing game provided as one of the tutorial projects in the popular game development engine Unity. This paper presents the first step towards minimizing or even eliminating the need for a modeling expert in the workflow, thus making automated planning accessible to a broader audience.

Published
2024

2. Learning Planning Action Models from State Traces

Author

Balyo, Tomáš, Suda, Martin, Chrpa, Lukáš, Šafránek, Dominik, Dvořák, Filip, Barták, Roman, and Youngblood, G. Michael

Subjects
Computer Science - Artificial Intelligence
Abstract

Previous STRIPS domain model acquisition approaches that learn from state traces start with the names and parameters of the actions to be learned. Therefore their only task is to deduce the preconditions and effects of the given actions. In this work, we explore learning in situations when the parameters of learned actions are not provided. We define two levels of trace quality based on which information is provided and present an algorithm for each. In one level (L1), the states in the traces are labeled with action names, so we can deduce the number and names of the actions, but we still need to work out the number and types of parameters. In the other level (L2), the states are additionally labeled with objects that constitute the parameters of the corresponding grounded actions. Here we still need to deduce the types of the parameters in the learned actions. We experimentally evaluate the proposed algorithms and compare them with the state-of-the-art learning tool FAMA on a large collection of IPC benchmarks. The evaluation shows that our new algorithms are faster, can handle larger inputs and provide better results in terms of learning action models more similar to reference models.

Published
2024

4. Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks

Author

Stern, Roni, Sturtevant, Nathan, Felner, Ariel, Koenig, Sven, Ma, Hang, Walker, Thayne, Li, Jiaoyang, Atzmon, Dor, Cohen, Liron, Kumar, T. K. Satish, Boyarski, Eli, and Bartak, Roman

Subjects
Computer Science - Artificial Intelligence, Computer Science - Multiagent Systems, Computer Science - Robotics
Abstract

The MAPF problem is the fundamental problem of planning paths for multiple agents, where the key constraint is that the agents will be able to follow these paths concurrently without colliding with each other. Applications of MAPF include automated warehouses and autonomous vehicles. Research on MAPF has been flourishing in the past couple of years. Different MAPF research papers make different assumptions, e.g., whether agents can traverse the same road at the same time, and have different objective functions, e.g., minimize makespan or sum of agents' actions costs. These assumptions and objectives are sometimes implicitly assumed or described informally. This makes it difficult to establish appropriate baselines for comparison in research papers, as well as making it difficult for practitioners to find the papers relevant to their concrete application. This paper aims to fill this gap and support researchers and practitioners by providing a unifying terminology for describing common MAPF assumptions and objectives. In addition, we also provide pointers to two MAPF benchmarks. In particular, we introduce a new grid-based benchmark for MAPF, and demonstrate experimentally that it poses a challenge to contemporary MAPF algorithms., Comment: Accepted to SoCS 2019: The 12th Annual Symposium on Combinatorial Search

Published
2019

5. Heuristic Learning in Domain-Independent Planning: Theoretical Analysis and Experimental Evaluation

Author

Trunda, Otakar, Barták, Roman, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Rocha, Ana Paula, editor, Steels, Luc, editor, and van den Herik, Jaap, editor

Published
2021
Full Text
View/download PDF

7. Planning as Tabled Logic Programming

Author

Zhou, Neng-Fa, Bartak, Roman, and Dovier, Agostino

Subjects
Computer Science - Artificial Intelligence, D.3.2
Abstract

This paper describes Picat's planner, its implementation, and planning models for several domains used in International Planning Competition (IPC) 2014. Picat's planner is implemented by use of tabling. During search, every state encountered is tabled, and tabled states are used to effectively perform resource-bounded search. In Picat, structured data can be used to avoid enumerating all possible permutations of objects, and term sharing is used to avoid duplication of common state data. This paper presents several modeling techniques through the example models, ranging from designing state representations to facilitate data sharing and symmetry breaking, encoding actions with operations for efficient precondition checking and state updating, to incorporating domain knowledge and heuristics. Broadly, this paper demonstrates the effectiveness of tabled logic programming for planning, and argues the importance of modeling despite recent significant progress in domain-independent PDDL planners., Comment: 27 pages in TPLP 2015

Published
2015
Full Text
View/download PDF

8. Using Tabled Logic Programming to Solve the Petrobras Planning Problem

Author

Barták, Roman and Zhou, Neng-Fa

Subjects
Computer Science - Artificial Intelligence, D.1.6, I.2.3, I.2.8
Abstract

Tabling has been used for some time to improve efficiency of Prolog programs by memorizing answered queries. The same idea can be naturally used to memorize visited states during search for planning. In this paper we present a planner developed in the Picat language to solve the Petrobras planning problem. Picat is a novel Prolog-like language that provides pattern matching, deterministic and non-deterministic rules, and tabling as its core modelling and solving features. We demonstrate these capabilities using the Petrobras problem, where the goal is to plan transport of cargo items from ports to platforms using vessels with limited capacity. Monte Carlo Tree Search has been so far the best technique to tackle this problem and we will show that by using tabling we can achieve much better runtime efficiency and better plan quality., Comment: To appear in Theory and Practice of Logic Programming (TPLP)

Published
2014

9. 3D Navigation for a Mobile Robot

Author

Škoda, Jan, Barták, Roman, Kacprzyk, Janusz, Series editor, Pal, Nikhil R., Advisory editor, Bello Perez, Rafael, Advisory editor, Corchado, Emilio S., Advisory editor, Hagras, Hani, Advisory editor, Kóczy, László T., Advisory editor, Kreinovich, Vladik, Advisory editor, Lin, Chin-Teng, Advisory editor, Lu, Jie, Advisory editor, Melin, Patricia, Advisory editor, Nedjah, Nadia, Advisory editor, Nguyen, Ngoc Thanh, Advisory editor, Wang, Jun, Advisory editor, Ollero, Anibal, editor, Sanfeliu, Alberto, editor, Montano, Luis, editor, Lau, Nuno, editor, and Cardeira, Carlos, editor

Published
2018
Full Text
View/download PDF

10. LOUGA: Learning Planning Operators Using Genetic Algorithms

Author

Kučera, Jiří, Barták, Roman, Hutchison, David, Series Editor, Kanade, Takeo, Series Editor, Kittler, Josef, Series Editor, Kleinberg, Jon M., Series Editor, Mattern, Friedemann, Series Editor, Mitchell, John C., Series Editor, Naor, Moni, Series Editor, Pandu Rangan, C., Series Editor, Steffen, Bernhard, Series Editor, Terzopoulos, Demetri, Series Editor, Tygar, Doug, Series Editor, Weikum, Gerhard, Series Editor, Yoshida, Kenichi, editor, and Lee, Maria, editor

Published
2018
Full Text
View/download PDF

11. Multi-agent Path Finding on Real Robots: First Experience with Ozobots

Author

Barták, Roman, Švancara, Jiří, Škopková, Věra, Nohejl, David, Hutchison, David, Series Editor, Kanade, Takeo, Series Editor, Kittler, Josef, Series Editor, Kleinberg, Jon M., Series Editor, Mattern, Friedemann, Series Editor, Mitchell, John C., Series Editor, Naor, Moni, Series Editor, Pandu Rangan, C., Series Editor, Steffen, Bernhard, Series Editor, Terzopoulos, Demetri, Series Editor, Tygar, Doug, Series Editor, Weikum, Gerhard, Series Editor, Simari, Guillermo R., editor, Fermé, Eduardo, editor, Gutiérrez Segura, Flabio, editor, and Rodríguez Melquiades, José Antonio, editor

Published
2018
Full Text
View/download PDF

12. Efficient Multi-site Data Movement Using Constraint Programming for Data Hungry Science

Author

Zerola, Michal, Lauret, Jérôme, Barták, Roman, and Šumbera, Michal

Subjects
Computer Science - Distributed, Parallel, and Cluster Computing
Abstract

For the past decade, HENP experiments have been heading towards a distributed computing model in an effort to concurrently process tasks over enormous data sets that have been increasing in size as a function of time. In order to optimize all available resources (geographically spread) and minimize the processing time, it is necessary to face also the question of efficient data transfers and placements. A key question is whether the time penalty for moving the data to the computational resources is worth the presumed gain. Onward to the truly distributed task scheduling we present the technique using a Constraint Programming (CP) approach. The CP technique schedules data transfers from multiple resources considering all available paths of diverse characteristic (capacity, sharing and storage) having minimum user's waiting time as an objective. We introduce a model for planning data transfers to a single destination (data transfer) as well as its extension for an optimal data set spreading strategy (data placement). Several enhancements for a solver of the CP model will be shown, leading to a faster schedule computation time using symmetry breaking, branch cutting, well studied principles from job-shop scheduling field and several heuristics. Finally, we will present the design and implementation of a corner-stone application aimed at moving datasets according to the schedule. Results will include comparison of performance and trade-off between CP techniques and a Peer-2-Peer model from simulation framework as well as the real case scenario taken from a practical usage of a CP scheduler., Comment: To appear in proceedings of Computing in High Energy and Nuclear Physics 2009

Published
2009
Full Text
View/download PDF

13. Using constraint programming to resolve the multi-source/multi-site data movement paradigm on the Grid

Author

Zerola, Michal, Lauret, Jerome, Bartak, Roman, and Sumbera, Michal

Subjects
Computer Science - Performance
Abstract

In order to achieve both fast and coordinated data transfer to collaborative sites as well as to create a distribution of data over multiple sites, efficient data movement is one of the most essential aspects in distributed environment. With such capabilities at hand, truly distributed task scheduling with minimal latencies would be reachable by internationally distributed collaborations (such as ones in HENP) seeking for scavenging or maximizing on geographically spread computational resources. But it is often not all clear (a) how to move data when available from multiple sources or (b) how to move data to multiple compute resources to achieve an optimal usage of available resources. We present a method of creating a Constraint Programming (CP) model consisting of sites, links and their attributes such as bandwidth for grid network data transfer also considering user tasks as part of the objective function for an optimal solution. We will explore and explain trade-off between schedule generation time and divergence from the optimal solution and show how to improve and render viable the solution's finding time by using search tree time limit, approximations, restrictions such as symmetry breaking or grouping similar tasks together, or generating sequence of optimal schedules by splitting the input problem. Results of data transfer simulation for each case will also include a well known Peer-2-Peer model, and time taken to generate a schedule as well as time needed for a schedule execution will be compared to a CP optimal solution. We will additionally present a possible implementation aimed to bring a distributed datasets (multiple sources) to a given site in a minimal time., Comment: 10 pages; ACAT 2008 workshop

Published
2008

14. On Verification of Workflow and Planning Domain Models Using Attribute Grammars

Author

Barták, Roman, Dvořák, Tomáš, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Sidorov, Grigori, editor, and Herrera-Alcántara, Oscar, editor

Published
2017
Full Text
View/download PDF

15. Using a Grammar Checker to Validate Compliance of Processes with Workflow Models

Author

Barták, Roman, Kuboň, Vladislav, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Sidorov, Grigori, editor, and Herrera-Alcántara, Oscar, editor

Published
2017
Full Text
View/download PDF

16. Hierarchical Task Model for Resource Failure Recovery in Production Scheduling

Author

Barták, Roman, Vlk, Marek, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Sidorov, Grigori, editor, and Herrera-Alcántara, Oscar, editor

Published
2017
Full Text
View/download PDF

18. Dynamic Global Constraints: A First View

Author

Bartak, Roman

Subjects
Computer Science - Programming Languages, Computer Science - Artificial Intelligence, D.3.2, D.3.3, D.1.6
Abstract

Global constraints proved themselves to be an efficient tool for modelling and solving large-scale real-life combinatorial problems. They encapsulate a set of binary constraints and using global reasoning about this set they filter the domains of involved variables better than arc consistency among the set of binary constraints. Moreover, global constraints exploit semantic information to achieve more efficient filtering than generalised consistency algorithms for n-ary constraints. Continued expansion of constraint programming (CP) to various application areas brings new challenges for design of global constraints. In particular, application of CP to advanced planning and scheduling (APS) requires dynamic additions of new variables and constraints during the process of constraint satisfaction and, thus, it would be helpful if the global constraints could adopt new variables. In the paper, we give a motivation for such dynamic global constraints and we describe a dynamic version of the well-known alldifferent constraint., Comment: 11 pages. Proceedings ERCIM WG on Constraints (Prague, June 2001)

Published
2001

19. Interactive Timetabling

Author

Muller, Tomas and Bartak, Roman

Subjects
Computer Science - Programming Languages, Computer Science - Artificial Intelligence, D.3.2, D.3.3, F2.2
Abstract

Timetabling is a typical application of constraint programming whose task is to allocate activities to slots in available resources respecting various constraints like precedence and capacity. In this paper we present a basic concept, a constraint model, and the solving algorithms for interactive timetabling. Interactive timetabling combines automated timetabling (the machine allocates the activities) with user interaction (the user can interfere with the process of timetabling). Because the user can see how the timetabling proceeds and can intervene this process, we believe that such approach is more convenient than full automated timetabling which behaves like a black-box. The contribution of this paper is twofold: we present a generic model to describe timetabling (and scheduling in general) problems and we propose an interactive algorithm for solving such problems., Comment: 12 pages. Proceedings ERCIM WG on Constraints (Prague, June 2001)

Published
2001

24. Using Attribute Grammars to Model Nested Workflows with Extra Constraints

Author

Barták, Roman, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Freivalds, Rūsiņš Mārtiņš, editor, Engels, Gregor, editor, and Catania, Barbara, editor

Published
2016
Full Text
View/download PDF

25. Using Constraint Logic Programming to Schedule Solar Array Operations on the International Space Station

Author

Jelínek, Jan, Barták, Roman, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Gavanelli, Marco, editor, and Reppy, John, editor

Published
2016
Full Text
View/download PDF

27. A Novel Parsing-based Approach for Verification of Hierarchical Plans

Author

Bercher, Pascal, Behnke, Gregor, Maillard, Adrien H, Ondrckova, Simona, and Bartak, Roman

Abstract

Hierarchical Task Networks were proposed as amethod to describe plans by decomposition of tasks to subtasksuntil primitive tasks, actions, are obtained. Valid plans –sequences of actions – must adhere both to causal dependenciesbetween the actions and to the structure given by the decompositionof the goal task. Plan verification aims at finding if a givenplan is valid, that is, if it is causally consistent and it can beobtained by decomposition of some task. The paper describes anovel parsing-based approach for hierarchical plan verificationthat is orders of magnitude faster than existing methods.

Published
2020

29. Machine Breakdown Recovery in Production Scheduling with Simple Temporal Constraints

Author

Barták, Roman, Vlk, Marek, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Duval, Béatrice, editor, van den Herik, Jaap, editor, Loiseau, Stephane, editor, and Filipe, Joaquim, editor

Published
2015
Full Text
View/download PDF

30. Short-Term Motion Tracking Using Inexpensive Sensors

Author

Matzner, Filip, Barták, Roman, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Pichardo Lagunas, Obdulia, editor, Herrera Alcántara, Oscar, editor, and Arroyo Figueroa, Gustavo, editor

Published
2015
Full Text
View/download PDF

31. A Constraint-Based Planner for Mars Express Orbiter

Author

Kolombo, Martin, Barták, Roman, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Kobsa, Alfred, Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Goebel, Randy, Series editor, Tanaka, Yuzuru, Series editor, Wahlster, Wolfgang, Series editor, Siekmann, Jörg, Series editor, Gelbukh, Alexander, editor, Espinoza, Félix Castro, editor, and Galicia-Haro, Sofía N., editor

Published
2014
Full Text
View/download PDF

32. On Modeling Formalisms for Automated Planning

Author

Vodrážka, Jindřich, Barták, Roman, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Kobsa, Alfred, Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Goebel, Randy, Series editor, Tanaka, Yuzuru, Series editor, Wahlster, Wolfgang, Series editor, Siekmann, Jörg, Series editor, Agre, Gennady, editor, Hitzler, Pascal, editor, Krisnadhi, Adila A., editor, and Kuznetsov, Sergei O., editor

Published
2014
Full Text
View/download PDF

34. On Modeling Planning Problems: Experience from the Petrobras Challenge

Author

Barták, Roman, Zhou, Neng-Fa, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Goebel, Randy, editor, Siekmann, Jörg, editor, Wahlster, Wolfgang, editor, Castro, Félix, editor, Gelbukh, Alexander, editor, and González, Miguel, editor

Published
2013
Full Text
View/download PDF

35. Using Monte Carlo Tree Search to Solve Planning Problems in Transportation Domains

Author

Trunda, Otakar, Barták, Roman, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Goebel, Randy, editor, Siekmann, Jörg, editor, Wahlster, Wolfgang, editor, Castro, Félix, editor, Gelbukh, Alexander, editor, and González, Miguel, editor

Published
2013
Full Text
View/download PDF

36. Verifying Nested Workflows with Extra Constraints

Author

Barták, Roman, Rovenský, Vladimír, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Goebel, Randy, editor, Siekmann, Jörg, editor, Wahlster, Wolfgang, editor, Batyrshin, Ildar, editor, and González Mendoza, Miguel, editor

Published
2013
Full Text
View/download PDF

37. Reports of the Workshops of the 31st AAAI Conference on Artificial Intelligence

Author

Anderson, Monica, Bartak, Roman, Brownstein, John S., Buckeridge, David L., Eldardiry, Hoda, Geib, Christopher, Gini, Maria, Isaksen, Aaron, Keren, Sarah, Laddaga, Robert, Lisy, Viliam, Martin, Rodney, Martinez, David, Michalowski, Martin, Michael, Loizos, Mirsky, Reuth, Nguyen, Thanh, Paul, Michael J., Ponteiii, Enrico, Sanner, Scott, Shaban-Nejad, Arash, Sinha, Arunesh, Sohrabi, Shirin, Sricharan, Kumar, Srivastava, Biplav, Stefik, Mark, Streilein, William, Sturtevant, Nathan, Talamadupula, Kartik, Thielscher, Michael, Togelius, Julian, Tran, Son Cao, Tran-Thanh, Long, Wagner, Neal, Wallace, Byron C., Wilk, Szymon, and Zhu, Jichen

Subjects
Workshops (Educational programs) -- Conferences, meetings and seminars, Artificial intelligence -- Conferences, meetings and seminars, Artificial intelligence, Business, Association for the Advancement of Artificial Intelligence -- Conferences, meetings and seminars
Abstract

The AAAI-17 workshop program included 17 workshops covering a wide range of topics in AI. Workshops were held Sunday and Monday, February 45, 2017, at the Hilton San Francisco Union [...]

Published
2017

39. Decomposition, Merging, and Refinement Approach to Boost Inductive Logic Programming Algorithms

Author

Chovanec, Andrej, Barták, Roman, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Goebel, Randy, editor, Siekmann, Jörg, editor, Wahlster, Wolfgang, editor, Ramsay, Allan, editor, and Agre, Gennady, editor

Published
2012
Full Text
View/download PDF

40. MAK€– A System for Modelling, Optimising, and Analyzing Production in Small and Medium Enterprises

Author

Barták, Roman, Sheahan, Con, Sheahan, Ann, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Bieliková, Mária, editor, Friedrich, Gerhard, editor, Gottlob, Georg, editor, Katzenbeisser, Stefan, editor, and Turán, György, editor

Published
2012
Full Text
View/download PDF

41. On Generating Templates for Hypothesis in Inductive Logic Programming

Author

Chovanec, Andrej, Barták, Roman, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Goebel, Randy, editor, Siekmann, Jörg, editor, Wahlster, Wolfgang, editor, Batyrshin, Ildar, editor, and Sidorov, Grigori, editor

Published
2011
Full Text
View/download PDF

42. Optimizing Alternatives in Precedence Networks

Author

Barták, Roman, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Goebel, Randy, editor, Siekmann, Jörg, editor, Wahlster, Wolfgang, editor, Sidorov, Grigori, editor, Hernández Aguirre, Arturo, editor, and Reyes García, Carlos Alberto, editor

Published
2010
Full Text
View/download PDF

43. Constraint Models for Reasoning on Unification in Inductive Logic Programming

Author

Barták, Roman, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Goebel, Randy, editor, Siekmann, Jörg, editor, Wahlster, Wolfgang, editor, Dicheva, Darina, editor, and Dochev, Danail, editor

Published
2010
Full Text
View/download PDF

45. Revisiting Constraint Models for Planning Problems

Author

Barták, Roman, Toropila, Daniel, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Goebel, Randy, editor, Siekmann, Jörg, editor, Wahlster, Wolfgang, editor, Rauch, Jan, editor, Raś, Zbigniew W., editor, Berka, Petr, editor, and Elomaa, Tapio, editor

Published
2009
Full Text
View/download PDF

50. On Generators of Random Quasigroup Problems

Author

Barták, Roman, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Dough, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Carbonell, Jaime G., editor, Siekmann, Jörg, editor, Hnich, Brahim, editor, Carlsson, Mats, editor, Fages, François, editor, and Rossi, Francesca, editor

Published
2006
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results