Filters








2,989,334 Hits in 3.2 sec

State-set branching: Leveraging BDDs for heuristic search

Rune M. Jensen, Manuela M. Veloso, Randal E. Bryant
2008 Artificial Intelligence  
The framework relies on an extension of these algorithms from expanding a single state in each iteration to expanding a set of states.  ...  In this article, we present a framework called state-set branching that combines symbolic search based on reduced ordered Binary Decision Diagrams (BDDs) with best-first search, such as A* and greedy best-first  ...  However, the state set version traverses a search tree during the search process where each search node contains a set of states associated with the same cost estimates.  ... 
doi:10.1016/j.artint.2007.05.009 fatcat:5cx5peeluzculi3td7tqnpie54

Strong Stubborn Set Pruning for Star-Topology Decoupled State Space Search

Daniel Gnad, Jörg Hoffmann, Martin Wehrle
2019 The Journal of Artificial Intelligence Research  
Star-topology decoupled state space search, short decoupled search, addresses planning tasks where a single center component interacts with several leaf components.  ...  We herein show how to apply this idea to star-topology decoupled state space search, a recent search reformulation method invented in the context of classical AI planning.  ...  Daniel Gnad was supported by the German Research Foundation (DFG), under grant HO 2169/6-1, "Star-Topology Decoupled State Space Search".  ... 
doi:10.1613/jair.1.11576 fatcat:cyo4uqwrinadrgdmno6yw4w7za

Dynamic Traveling Salesman Problem in Stochastic-State Network Setting for Search-and-Rescue Application

David Fajardo, S. Travis Waller
2012 Transportation Research Record  
This problem is defined in a stochastic-state network setting, which allows the modeling of implicitly correlated demand stochasticity.  ...  Because of the complexity of the problem, a heuristic based on a two-stage stochastic programming approximation of the problem solved on an aggregated set of network states is provided.  ...  Dynamic Traveling Salesman Problem in Stochastic-State Network Setting for Search-and-Rescue Application David Fajardo and S.  ... 
doi:10.3141/2283-13 fatcat:jd3fhsvv3jas7b7apobude4iti

News Feature: The search for what sets humans apart

Robert Frederick
2015 Proceedings of the National Academy of Sciences of the United States of America  
Persistent Critiques, Obvious Answers A common critique of the search for what makes us uniquely human is our own intraspecies variation.  ...  Researchers used this experimental set-up to gauge how and when chimpanzees would recruit a partner and cooperate in order to solve a food retrieval challenge.  ... 
doi:10.1073/pnas.1423320112 pmid:25587106 pmcid:PMC4299222 fatcat:oqnfrij6jvczzacbzq6oghru5y

Search for the Higgs boson in the all-hadronic final state using the full CDF data set

T. Aaltonen, B. Álvarez González, S. Amerio, D. Amidei, A. Anastassov, A. Annovi, J. Antos, G. Apollinari, J. A. Appel, A. Apresyan, T. Arisawa, A. Artikov (+463 others)
2013 Journal of High Energy Physics  
The data are in agreement with the background model and 95 limits on Higgs boson production are set as a function of the Higgs boson mass.  ...  This paper reports the result of a search for the standard model Higgs boson in events containing four reconstructed jets associated with quarks.  ...  Summary A search for the Higgs boson is performed in the all-hadronic final state using 9.45 fb −1 of data collected by the CDF II detector.  ... 
doi:10.1007/jhep02(2013)004 fatcat:f6o5dulf3ngnfmmpiyh72azzbm

Correction for Lee et al., A robust method for searching the smallest set of smallest rings with a path-included distance matrix

2009 Proceedings of the National Academy of Sciences of the United States of America  
doi:10.1073/pnas.0911801106 fatcat:bjpj57f5bjc5vkk6wcujauig2a

A robust method for searching the smallest set of smallest rings with a path-included distance matrix

C. J. Lee, Y.-M. Kang, K.-H. Cho, K. T. No
2009 Proceedings of the National Academy of Sciences of the United States of America  
BIOPHYSICS AND COMPUTATIONAL BIOLOGY Correction for "A robust method for searching the smallest set of smallest rings with a path-included distance matrix," by Chang  ...  To overcome the limitations in path search resulting from using distance matrix, we introduced the PID matrix.  ...  Smallest set of smallest ring (SSSR) is the characteristic feature of such graphs.  ... 
doi:10.1073/pnas.0813040106 pmid:19805142 pmcid:PMC2765087 fatcat:uliaaf43qbcgnj3xrqjgtdwec4

STUDY OF THE MATHEMATICAL MODEL OF THE THIRD-ORDER RELAY-MODAL CONTROL SYSTEM WITH THE PURPOSE OF SEARCH FOR EXTREMAL SETTINGS OF CONTROLLERS

A. L. Derets, A. V. Sadovoi, A. A. Derets
2020 Collection of scholarly papers of Dniprovsk State Technical University (Technical Sciences)  
doi:10.31319/2519-2884.36.2020.11 fatcat:wcvmgbar55gkjlusmivzvbocnm

Search for a Higgs boson in the diphoton final state using the full CDF data set from pp¯ collisions at s=1.96 TeV

T. Aaltonen, B. Álvarez González, S. Amerio, D. Amidei, A. Anastassov, A. Annovi, J. Antos, G. Apollinari, J.A. Appel, T. Arisawa, A. Artikov, J. Asaadi (+462 others)
2012 Physics Letters B  
No evidence of signal is observed, and upper limits are set on the cross section times branching ratio of the resonant state as a function of Higgs boson mass.  ...  In addition to searching for a resonance in the diphoton mass spectrum, we employ a multivariate discriminant technique for the first time in this channel at CDF.  ...  In order to improve sensitivity for the fermiophobic Higgs boson search, the event selection is extended by taking advantage of the final-state features present in the VH and VBF processes.  ... 
doi:10.1016/j.physletb.2012.08.051 fatcat:cnwe6zhrqvhcvivmrmvxgvg6ey

Multimapping Abstraction and State-set Search Theory

Bo Pang
2012
The second part of this thesis is focused on the theory of state-set search. This theory investigates the scenario that a set of states are manipulated as a single state-set by a search algorithm.  ...  Based on this theory, we have found a path-based distance, d ww , which is the maximum admissible distance between two state-sets. First of all, I would like to thank my supervisor Dr.  ...  Conclusions This chapter presents the state-set search theory which investigates the scenario that a set of states are manipulated as a single state-set by a search algorithm.  ... 
doi:10.7939/r3dw6t fatcat:adkmwnfihfhz7lt2w3bwl4udg4

Exotics searches in set final states with the ATLAS detector

Adam GIBSON
2012 Proceedings of XXIst International Europhysics Conference on High Energy Physics — PoS(EPS-HEP2011)   unpublished
We summarize searches for physics beyond the Standard Model with events containing jets in the final state in pp collision data recorded with the ATLAS detector at the LHC.  ...  The data are compared to Standard Model expectations with the goal of searching for new phenomena: heavy resonances, contact interactions and gravitationallymediated effects in large extra dimensions,  ...  Details of the monojet search can be found elsewhere [8].  ... 
doi:10.22323/1.134.0220 fatcat:jysgwbeabbfvrfyzq5fqtcno2e

Logical Analysis of Complex Network Searching

Ablimit Arxiden, Shanxia Wang, Huiwen Deng
2015 Open Cybernetics and Systemics Journal  
All possible network search state sets in the search strategy can be described with first-order modal predicate logic.  ...  The article also presents the definition of complex network search states set and its relationship with first-order modal predicate logic.  ...  Second, set limitation to the individual set of network search state; node set in all possible network search states shall be same as the value of explained node domain D .  ... 
doi:10.2174/1874110x01509012681 fatcat:my7gxez6g5g33lhycpcojiwsie

Bounded partial-order reduction

Katherine E. Coons, Madan Musuvathi, Kathryn S. McKinley
2013 Proceedings of the 2013 ACM SIGPLAN international conference on Object oriented programming systems languages & applications - OOPSLA '13  
Two prior approaches alleviate state-space explosion. (1) Dynamic partial-order reduction (DPOR) provides full coverage and explores only one interleaving of independent transitions. (2) Bounded search  ...  Exhaustively exploring the state-space of a program's thread interleavings finds concurrency errors and provides coverage guarantees, but suffers from exponential state-space explosion.  ...  In unbounded search, persistent sets are local sufficient, provided that the state space is acyclic [7] . Persistent sets may not be local sufficient in bounded search, however.  ... 
doi:10.1145/2509136.2509556 dblp:conf/oopsla/CoonsMM13 fatcat:j43qgteweffjzlgpwxbbng6ydy

Bounded partial-order reduction

Katherine E. Coons, Madan Musuvathi, Kathryn S. McKinley
2013 SIGPLAN notices  
Two prior approaches alleviate state-space explosion. (1) Dynamic partial-order reduction (DPOR) provides full coverage and explores only one interleaving of independent transitions. (2) Bounded search  ...  Exhaustively exploring the state-space of a program's thread interleavings finds concurrency errors and provides coverage guarantees, but suffers from exponential state-space explosion.  ...  In unbounded search, persistent sets are local sufficient, provided that the state space is acyclic [7] . Persistent sets may not be local sufficient in bounded search, however.  ... 
doi:10.1145/2544173.2509556 fatcat:it4qwj2dkjecbd6z7xx6bwwnoa

Inference of finite automata: Reducing the search space with an ordering of pairs of states [chapter]

François Coste, Jacques Nicolas
1998 Lecture Notes in Computer Science  
We investigate the set of all minimal deterministic nite automata accepting a given set of words and rejecting another given set of words.  ...  We present several criteria to order the exploration of the corresponding search space.  ...  The search tree as a decision tree We have so far presented the search space as an ordered set of choices of pairs of states.  ... 
doi:10.1007/bfb0026669 fatcat:6w3e3qxatvhm3aep6k4bk7k3qa
« Previous Showing results 1 — 15 out of 2,989,334 results