1,187 Hits in 5.5 sec

Landmark-enhanced abstraction heuristics

Carmel Domshlak, Michael Katz, Sagi Lefler
2012 Artificial Intelligence  
Abstractions and landmarks are two of the key mechanisms for devising admissible heuristics for domain-independent planning.  ...  Our formal and empirical analysis shows that landmark information can substantially improve the quality of heuristic estimates.  ...  adding more children to forks' roots), and induces patterns that would not be present in the fork-decomposition of Π at all.  ... 
doi:10.1016/j.artint.2012.05.003 fatcat:3zsozri43vhd5hci5sj5sxx7g4

Optimal admissible composition of abstraction heuristics

Michael Katz, Carmel Domshlak
2010 Artificial Intelligence  
(regular or constrained) and merge-andshrink, and implicit abstractions such as fork-decomposition and abstractions based on tractable constraint optimization over tree-shaped constraint networks.  ...  h m [16], landmark heuristics h L , h LA [22] and h LM-cut [18], and abstraction heuristics such as pattern databases [10], merge-and-shrink [19], and implicit abstractions [25] .  ...  The description of the planners is given in Section 9; here the fork-decomposition heuristics are via implicit abstraction databases.  ... 
doi:10.1016/j.artint.2010.04.021 fatcat:6tgnf3iy4jeytho33zhpb467m4

Function modeling using the system state flow diagram

Unal Yildirim, Felician Campean, Huw Williams
2017 Artificial intelligence for engineering design, analysis and manufacturing  
The SSFD heuristics extend the existing framework of Otto and Wood (2001) by introducing a conditional fork node heuristic, to facilitate analysis and aggregation of function models across multiple modes  ...  A set of heuristics are introduced to support the function decomposition analysis and to facilitate the deployment of the methodology with strong practitioner guidelines.  ...  The flows for UC2 and UC3 are connected to the output state of the UC1 flow (stored DC electric energy) via fork node F2; in this case, the fork node F2 can be treated as a simple branching flow as the  ... 
doi:10.1017/s0890060417000294 fatcat:o6jizxej5ffgxdrs76zfh2ugtu

Real-time semi-partitioned scheduling of fork-join tasks using work-stealing

Cláudio Maia, Patrick Meumeu Yomsi, Luís Nogueira, Luis Miguel Pinho
2017 EURASIP Journal on Embedded Systems  
(Semi-partitioned scheduling of fork-join tasks using workstealing, 2017) where we address the semi-partitioned scheduling of real-time fork-join tasks on multicore platforms.  ...  In this paper, we consider different allocation heuristics and we evaluate the behavior of two different heuristics when they are integrated within our approach.  ...  An alternative approach is the generation of patterns via enumeration. Equation 2 is part of a set of algorithms that were proposed in [7] for the finding of patterns for multiframe tasks.  ... 
doi:10.1186/s13639-017-0079-5 fatcat:fmnw6gky4zdl7d7zrl4qzrpd4q

Implicit Abstraction Heuristics

M. Katz, C. Domshlak
2010 The Journal of Artificial Intelligence Research  
By contrast, while fork-decomposition heuristics can be calculated in polynomial time, computing them is far from being fast.  ...  We then verify empirically that heuristic search with the "databased" fork-decomposition heuristics favorably competes with the state of the art of cost-optimal planning.  ...  These so called fork-decomposition heuristics are based on two novel fragments of tractable cost-optimal planning for tasks with fork and inverted-fork structured causal graphs.  ... 
doi:10.1613/jair.3063 fatcat:edcs4ifp7ve3lehyczcme5bpvq

Implicit abstraction heuristics for cost-optimal planning

Michael Katz
2011 AI Communications  
The description of the planners is given in Section 4.4.2; here the fork-decomposition heuristics are via databased implicit abstractions.  ...  These so called fork-decomposition heuristics are based on two novel fragments of tractable costoptimal planning for tasks with fork and inverted-fork structured causal graphs.  ...  The description of the planners is given in Section 5.5; here the fork-decomposition heuristics are via implicit abstraction databases.  ... 
doi:10.3233/aic-2011-0504 fatcat:mhnc7i23vbfvphrgjt3nuc2jhq

Cost-aware Integration Process Modeling in Multiclouds [article]

Daniel Ritter
2021 arXiv   pre-print
To make the solution tractable for larger, productive INTaaS processes, it is relaxed by using a local search heuristic, and complemented by correctness-preserving model decomposition.  ...  Thereby, compositions of integration patterns denote the required integration logic as integration processes, currently running in single-clouds.  ...  defined in Definition 2. • if type(p) ∈ {fork, Definition 2 (Pattern characteristic and configuration [2] ).  ... 
arXiv:2103.08675v2 fatcat:vji5kad63bh6rm3cfx3vuhdsqi

Control-Flow-Based Methods to Support the Development of Sound Workflows

Thomas M. Prinz, Course Evaluation Center, Friedrich Schiller University Jena, Am Steiger 3, Haus 1, 07743 Jena, Germany, Wolfram Amme, Research group Program Analysis and Optimization, Friedrich Schiller University Jena, Ernst-Abbe-Platz 2, 07743 Jena, Germany
2021 Complex Systems Informatics and Modeling Quarterly  
[18] with the introduction of the Process Structure Tree (PST) as a result of decomposition into Single-Entry-Single-Exits (SESE).  ...  Pattern-and Compiler-Based Approaches Approaches that take into account the structure of workflows such as compilers are alternatives to model-checking.  ... 
doi:10.7250/csimq.2021-27.01 fatcat:cshdkbooovfbhluyguqiws7q2m

A Java fork/join framework

Doug Lea
2000 Proceedings of the ACM 2000 conference on Java Grande - JAVA '00  
Since FJTaskRunner operations are all intimately tied to the concrete details of the deque (for example, fork simply invokes push), this data structure is directly embedded in the class rather than being  ...  The worst was for the LU decomposition program (speedup of 15.35 for 30 threads).  ... 
doi:10.1145/337449.337465 dblp:conf/java/Lea00 fatcat:urqqedciujcjddy7nxl6bj3wbe

The influence of k-dependence on the complexity of planning

Omer Giménez, Anders Jonsson
2012 Artificial Intelligence  
Katz and Domshlak (2008b) introduced a generalization of the PDB abstractions that they call causal graph structural patterns (CGSP).  ...  The shape of the causal graph captures part of the underlying structure of the problem. For example, causal graphs have been used in the context of hierarchical decomposition.  ... 
doi:10.1016/j.artint.2011.12.002 fatcat:enu4oqygfveqrbxkeisi6f7euy

Minimum Cardinality Matrix Decomposition into Consecutive-Ones Matrices: CP and IP Approaches [chapter]

Davaatseren Baatar, Natashia Boland, Sebastian Brand, Peter J. Stuckey
2007 Lecture Notes in Computer Science  
However finding a decomposition of minimal cardinality is NP-hard.  ...  Progress so far has largely been restricted to heuristic algorithms, mostly using linear programming, integer programming and combinatorial enumerative methods as the solving technologies.  ...  N b can be related to Q b via (19).  ... 
doi:10.1007/978-3-540-72397-4_1 fatcat:d6u7niqnwfd4lgvnealscscije

Relevance via decomposition

David Makinson
2017 The Australasian Journal of Logic  
We report on progress and an unsolved problem in our attempt to obtain a clear rationale for relevance logic via semantic decomposition trees.  ...  To extend it, a natural recursion is built into the procedure for constructing decomposition trees.  ...  A similar pattern emerges in the decomposition tree for ¬(p → p) → (q → q), which we might call 'symmetric explosion for arrow'.  ... 
doi:10.26686/ajl.v14i3.4009 fatcat:xov74g7z6bhctjsxfn7gxwlehi

Monte Carlo Tree Search in Hex

Broderick Arneson, Ryan B. Hayward, Philip Henderson
2010 IEEE Transactions on Computational Intelligence and AI in Games  
Heuristic Techniques Both the bridge pattern and AMAF heuristic give major strength gains for MoHex.  ...  Six significantly refines the Hexy framework by improving H-search efficiency via heuristic limits, restricting the alpha-beta branching factor, tuning the evaluation function, and using a small amount  ... 
doi:10.1109/tciaig.2010.2067212 fatcat:thofs5ttwbbgbemzp7ylbvl6ea

Qos architectural patterns for self-architecting software systems

Daniel A. Menasce, João P. Sousa, Sam Malek, Hassan Gomaa
2010 Proceeding of the 7th international conference on Autonomic computing - ICAC '10  
A case study illustrates the role of patterns in the application of the self-architecting heuristic to the motivating example.  ...  After summarizing the heuristic used for self-architecting, the paper discusses a number of architectural patterns and the corresponding quantitative models for two concrete aspects of quality of service  ...  Supported gateways include Conditional-Or, Fork, and And-Join, with the same meaning as in BPMN.  ... 
doi:10.1145/1809049.1809084 dblp:conf/icac/MenasceSMG10 fatcat:bchhftryxbg2rih577vaxczwd4

Task-Relevant Encoding of Domain Knowledge in Dynamics Modelling: Application to Furnace Forecasting from Video

Brendan Michael, Akifumi Ise, Kaoru Kawabata, Takamitsu Matsubara
2022 IEEE Access  
Specifically, this method combines dynamics modelling and forecasting using dynamic mode decomposition, with Fourier transformations informed by expert operator heuristic knowledge for encoding task-relevant  ...  Specifically, cost-efficiency is achieved by encoding expert heuristic knowledge about the dynamical system (e.g., combustion decay rates) as part of the decomposition process (FIGURE 1 ), thereby learning  ...  PRELIMINARIES To address the problems of dynamics modelling from video, a pertinent approach is spatio-temporal decomposition, which explicitly extracts intuitive spatial structures and corresponding time  ... 
doi:10.1109/access.2022.3140758 fatcat:nqlrsbprzreqlgc3bseny5rfqm
« Previous Showing results 1 — 15 out of 1,187 results