A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Filters
Efficient Enumeration of d-Minimal Paths in Reliability Evaluation of Multistate Networks
2019
Complexity
Preserved Fulltext
A number of real-world complex networks can be modeled as multistate networks for performance analysis. ...
Then, the max-flow algorithm and the enumeration algorithm are integrated to search for d-minimal paths in the determined search space that is recursively divided into subspaces such that the searching ...
For practical applications, binary state network model has been extended and replaced by multistate network model to characterize complex behaviors of multistate networks. ...
doi:10.1155/2019/4561845
fatcat:aauzcob2a5emve5fgo6dyxtwpa
Revising the evolutionary computation abstraction
2010
Proceedings of the 12th annual conference on Genetic and evolutionary computation - GECCO '10
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
This abstraction leads to the key idea in this paper: Searching for novel ways of meeting the same minimal criteria, which is an accelerated model of this new abstraction, may be an effective search algorithm ...
Though based on abstractions of nature, current evolutionary algorithms and artificial life models lack the drive to complexity characteristic of natural evolution. ...
Inspired by a new abstraction of natural evolution, MCNS addresses both practical issues when searching through vast behavior spaces and the complexity disparity between EC models and natural evolution ...
doi:10.1145/1830483.1830503
dblp:conf/gecco/LehmanS10
fatcat:vbtlqn2h4jbmpgg7hs6dkaadci
Vasopressin and oxytocin receptors
2001
TIPS - Trends in Pharmacological Sciences
Preserved Fulltext
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.
In this work we describe an effective procedure of preparation of the receptor-ligand complexes. The amino-acid residues involved in ligand binding were identified and described. ...
The next steps were: 1. preparation of full-atom models with atomic charges, 2. their relaxation and minimization (stand-alone and in the complexes with V 1a R, V 2 R and OTR). ...
Final complexes were selected based on the criterion of the internal ligand energy of the minimized receptor-ligand complexes. ...
doi:10.1016/s0165-6147(01)80051-1
fatcat:sxpkt7bhkjhrjfdlswfo2gpfju
Vasopressin and oxytocin receptors
1993
TIPS - Trends in Pharmacological Sciences
Preserved Fulltext
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.
In this work we describe an effective procedure of preparation of the receptor-ligand complexes. The amino-acid residues involved in ligand binding were identified and described. ...
The next steps were: 1. preparation of full-atom models with atomic charges, 2. their relaxation and minimization (stand-alone and in the complexes with V 1a R, V 2 R and OTR). ...
Final complexes were selected based on the criterion of the internal ligand energy of the minimized receptor-ligand complexes. ...
doi:10.1016/0165-6147(93)90168-j
fatcat:hfvl4nybbnczxkiobz42hxc4qu
Vasopressin and oxytocin receptors
1996
Journal of Endocrinology
Preserved Fulltext
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.
In this work we describe an effective procedure of preparation of the receptor-ligand complexes. The amino-acid residues involved in ligand binding were identified and described. ...
The next steps were: 1. preparation of full-atom models with atomic charges, 2. their relaxation and minimization (stand-alone and in the complexes with V 1a R, V 2 R and OTR). ...
Final complexes were selected based on the criterion of the internal ligand energy of the minimized receptor-ligand complexes. ...
doi:10.1677/joe.0.148s019
fatcat:dnm5be2knjhv5g7gfuxarszvue
Approximate Model-Based Diagnosis Using Greedy Stochastic Search
[chapter]
2007
Lecture Notes in Computer Science
Preserved Fulltext
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.
80-90% of all cardinality-minimal diagnoses, several orders of magnitude faster than state-of-the-art deterministic algorithms. ...
Introduction Model-Based Diagnosis (MBD) is an area of abductive or model-based inference in which a system model is used, together with observations about system behavior, to isolate sets of faulty components ...
Moreover, whereas the search complexity for the deterministic algorithms tested increases exponentially with fault cardinality, the search complexity for this stochastic algorithm appears to be independent ...
doi:10.1007/978-3-540-73580-9_13
fatcat:4mrt3p3rsbho5ef2qp7fmljp6e
Heuristic Search Based Feature Selection and Discretive Self-Organized Map Clustering for Spatio-Temporal Pattern Discovery
2019
VOLUME-8 ISSUE-10, AUGUST 2019, REGULAR ISSUE
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
In order to improve the accurate pattern discovery, Heuristic Best-First Search based Discretized Self-Organizing Feature Map (HBFS-DSOFM) Model is introduced. ...
The results confirm that the proposed HBFS-DSOFM model increases the Spatio-temporal pattern discovery in terms of high clustering accuracy with a less false positive rate as well as minimum time complexity ...
This process minimizing the time complexity. ...
doi:10.35940/ijitee.j1035.08810s19
fatcat:cxrs27swxnbnhimo65ye6436o4
Page 4884 of Mathematical Reviews Vol. , Issue 90H
[page]
1990
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
The problem is to find the optimal search plan which minimizes the expected risk (the expected search cost minus the expected reward). ...
The scheduling models are compat- ible with the master planning system in which profit-based planning objectives are taken into account.”
90h:90092 90B40
lida, Kdji (J-NDA)
Optimal search plan minimizing ...
Approximate Model-Based Diagnosis Using Greedy Stochastic Search
2010
The Journal of Artificial Intelligence Research
Preserved Fulltext
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.
Other Versions
By modeling the algorithm itself as a Markov chain, we provide exact bounds on the minimality of the diagnosis computed. ...
We also prove that SAFARI is optimal for a range of propositional fault models, such as the widely-used weak-fault models (models with ignorance of abnormal behavior). ...
Moreover, whereas the search complexity for the deterministic algorithms tested increases exponentially with fault cardinality, the search complexity for this stochastic algorithm appears to be independent ...
doi:10.1613/jair.3025
fatcat:c2xoewxqkrcadnaucobnor34sy
A Quantitative Analysis of Minimal Window Search
1987
International Joint Conference on Artificial Intelligence
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Nevertheless, there exists no theoretical model to measure the strengths and weaknesses of minimal window search. ...
In particular, it is not known which tree ordering properties are favorable for minimal window search. ...
Analysis of The quantitative analysis of aB is more complex, because < search process uses a window that may take any size from minimal to full-width. ...
dblp:conf/ijcai/ReinefeldM87
fatcat:3dc2yzcutfavtcah7krrdflooq
Vasopressin and oxytocin receptors
1997
TIPS - Trends in Pharmacological Sciences
Preserved Fulltext
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.
In this work we describe an effective procedure of preparation of the receptor-ligand complexes. The amino-acid residues involved in ligand binding were identified and described. ...
The next steps were: 1. preparation of full-atom models with atomic charges, 2. their relaxation and minimization (stand-alone and in the complexes with V 1a R, V 2 R and OTR). ...
Final complexes were selected based on the criterion of the internal ligand energy of the minimized receptor-ligand complexes. ...
doi:10.1016/s0165-6147(97)89538-5
fatcat:x33teznhrbe5tm5cnq6wem4aqq
AND/OR Cutset Conditioning
2005
International Joint Conference on Artificial Intelligence
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
This paper takes a fresh look at these methods through the spectrum of AND/OR search spaces for graphical models. ...
Cutset conditioning is one of the methods of solving reasoning tasks for graphical models, especially when space restrictions make inference (e.g., jointree-clustering) algorithms infeasible. ...
The instantiations of C are enumerated by regular OR search, yielding linear space complexity and O(exp |C|) time complexity, therefore requiring a minimal cycle cutset to optimize complexity. ...
dblp:conf/ijcai/MateescuD05
fatcat:xuls3mcu3vbqjgpoynvvbet2fq
Foraging in complex environments: When prey availability varies over time and space
1989
Theoretical Population Biology
Preserved Fulltext
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.
This model is more complex than those in the literature which are constructed using one search mode exclusively. ...
An optimal foraging model is presented which combines simultaneous and nonsimultaneous modes of search for food. ...
Stephens, and an anonymous reviewer for critically reading the manuscript, and the 1986 NR416/BIO 472 class at the University of Michigan for discussions about the models. ...
doi:10.1016/0040-5809(89)90026-9
fatcat:lufmeyafa5aqxlmssuojayvqhe
Heuristic Algorithms for Power Amplifier Behavioral Modeling
2007
IEEE Microwave and Wireless Components Letters
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
Index Terms-Behavioral models, genetic algorithm, heuristic search, power amplifier (PA), simulated annealing. ...
This letter presents the use of two heuristic search algorithms, named simulated annealing and genetic algorithms, for the extraction of power amplifier (PA) behavioral model parameters. ...
In order to minimize these behavioral models complexity (searching computationally efficient behavioral models) some studies have been aimed at determining the minimum memory length needed to accurately ...
doi:10.1109/lmwc.2007.905628
fatcat:52zsfrmkyvdatjknmbxkeuttca
Book announcement
1992
Discrete Applied Mathematics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Definitions and complexity (Routing in floorplans. Area routing. Complexity of global routing problems). ...
Definitions and complexities (MuMway partitions. Bipartitions. Separators. Free partitions. Modeling hypergraphs with graphs). Heuristics for bipartitioning hypergraphs (The Kernighan-Lin heuristic. ...
doi:10.1016/0166-218x(92)90299-p
fatcat:kkkpojidyvgifm6vpfwb5c2epi
« Previous
Showing results 1 — 15 out of 1,131,822 results