A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

## Filters

##
###
State-set branching: Leveraging BDDs for heuristic search

2008
*
Artificial Intelligence
*

The framework relies on an extension of these algorithms from expanding a single

doi:10.1016/j.artint.2007.05.009
fatcat:5cx5peeluzculi3td7tqnpie54
*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. ...##
###
Strong Stubborn Set Pruning for Star-Topology Decoupled State Space Search

2019
*
The Journal of Artificial Intelligence Research
*

Star-topology decoupled

doi:10.1613/jair.1.11576
fatcat:cyo4uqwrinadrgdmno6yw4w7za
*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*". ...##
###
Dynamic Traveling Salesman Problem in Stochastic-State Network Setting for Search-and-Rescue Application

2012
*
Transportation Research Record
*

This problem is defined in a stochastic-

doi:10.3141/2283-13
fatcat:jd3fhsvv3jas7b7apobude4iti
*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. ...##
###
News Feature: The search for what sets humans apart

2015
*
Proceedings of the National Academy of Sciences of the United States of America
*

Persistent Critiques, Obvious Answers A common critique of the

doi:10.1073/pnas.1423320112
pmid:25587106
pmcid:PMC4299222
fatcat:oqnfrij6jvczzacbzq6oghru5y
*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. ...##
###
Search for the Higgs boson in the all-hadronic final state using the full CDF data set

2013
*
Journal of High Energy Physics
*

The data are in agreement with the background model and 95 limits on Higgs boson production are

doi:10.1007/jhep02(2013)004
fatcat:f6o5dulf3ngnfmmpiyh72azzbm
*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. ...##
###
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
*

##
###
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
*

BIOPHYSICS AND COMPUTATIONAL BIOLOGY Correction for "A robust method for

doi:10.1073/pnas.0813040106
pmid:19805142
pmcid:PMC2765087
fatcat:uliaaf43qbcgnj3xrqjgtdwec4
*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. ...##
###
STUDY OF THE MATHEMATICAL MODEL OF THE THIRD-ORDER RELAY-MODAL CONTROL SYSTEM WITH THE PURPOSE OF SEARCH FOR EXTREMAL SETTINGS OF CONTROLLERS

2020
*
Collection of scholarly papers of Dniprovsk State Technical University (Technical Sciences)
*

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

2012
*
Physics Letters B
*

No evidence of signal is observed, and upper limits are

doi:10.1016/j.physletb.2012.08.051
fatcat:cnwe6zhrqvhcvivmrmvxgvg6ey
*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. ...##
###
Multimapping Abstraction and State-set Search Theory

2012

The second part of this thesis is focused on the theory of

doi:10.7939/r3dw6t
fatcat:adkmwnfihfhz7lt2w3bwl4udg4
*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. ...##
###
Exotics searches in set final states with the ATLAS detector

2012
*
Proceedings of XXIst International Europhysics Conference on High Energy Physics — PoS(EPS-HEP2011)
*
unpublished

We summarize

doi:10.22323/1.134.0220
fatcat:jysgwbeabbfvrfyzq5fqtcno2e
*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]. ...##
###
Logical Analysis of Complex Network Searching

2015
*
Open Cybernetics and Systemics Journal
*

All possible network

doi:10.2174/1874110x01509012681
fatcat:my7gxez6g5g33lhycpcojiwsie
*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 . ...##
###
Bounded partial-order reduction

2013
*
Proceedings of the 2013 ACM SIGPLAN international conference on Object oriented programming systems languages & applications - OOPSLA '13
*

Two prior approaches alleviate

doi:10.1145/2509136.2509556
dblp:conf/oopsla/CoonsMM13
fatcat:j43qgteweffjzlgpwxbbng6ydy
*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. ...##
###
Bounded partial-order reduction

2013
*
SIGPLAN notices
*

Two prior approaches alleviate

doi:10.1145/2544173.2509556
fatcat:it4qwj2dkjecbd6z7xx6bwwnoa
*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. ...##
###
Inference of finite automata: Reducing the search space with an ordering of pairs of states
[chapter]

1998
*
Lecture Notes in Computer Science
*

We investigate the

doi:10.1007/bfb0026669
fatcat:6w3e3qxatvhm3aep6k4bk7k3qa
*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*. ...
« Previous

*Showing results 1 — 15 out of 2,989,334 results*