1,541,731 Hits in 4.1 sec

Dynamic sets for search

David Steere, M. Satyanarayanan, Jeannette M. Wing
1994 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing - PODC '94  
Therefore, a wide area data storage system (WADSS) must provide supporl for search.  ...  Search through a WADSS differs from search through a (distributed) database in that users are willing to trade consistency for performance.  ... 
doi:10.1145/197917.198177 dblp:conf/podc/SteereSW94 fatcat:s6d7vrtb3bemzojphuhergmq7e

The structure of covtree: searching for manifestly covariant causal set dynamics [article]

Stav Zalel
2020 arXiv   pre-print
Covtree - a partial order on certain sets of finite, unlabeled causal sets - is a manifestly covariant framework for causal set dynamics.  ...  We identify the paths which correspond to causal sets which have a unique natural labeling, thereby solving for the class of dynamics which give rise to these causal sets with unit probability.  ...  Having said that, these results could be used to advance the search for physical covtree dynamics. In the remainder of this section, we present directions for further study.  ... 
arXiv:2008.02607v1 fatcat:uldhohjnpjbvlnscd5hbvpmcze

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

David Fajardo, S. Travis Waller
2012 Transportation Research Record  
The problem presented in this paper was motivated by the need for a solution to be used in a search-and-rescue application and is formulated as a dynamic traveling salesman problem in a stochastic-state  ...  the appropriate number of search-and-rescue units, the necessary resources to allow the timely rescue of victims, and an efficient and flexible plan for units to follow.  ...  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

Efficient Local Search based on Dynamic Connectivity Maintenance for Minimum Connected Dominating Set

Xindi Zhang, Bohan Li, Shaowei Cai, Yiyuan Wang
2021 Journal of Artificial Intelligence Research  
We design a new local search algorithm called FastCDS based on the three ideas.  ...  The minimum connected dominating set (MCDS) problem is an important extension of the minimum dominating set problem, with wide applications, especially in wireless networks.  ...  We would like to thank the anonymous referees for their helpful comments.  ... 
doi:10.1613/jair.1.12618 dblp:journals/jair/ZhangLCW21 fatcat:w3zmvbhj6vhrdcshlmt3ivxw4a

Explanation-Guided Fairness Testing through Genetic Algorithm [article]

Ming Fan, Wenying Wei, Wuxia Jin, Zijiang Yang, Ting Liu
2022 arXiv   pre-print
A plethora of research has proposed diverse methods for individual fairness testing.  ...  ExpGA then adopts GA to search discriminatory sample candidates by optimizing a fitness value.  ...  When the set of item attributes is well-defined and known a priori, existing techniques such as faceted search [24, 42] or example critiquing [12, 13] can be used directly.  ... 
arXiv:2205.08335v1 fatcat:kwcxbsoif5ct3cq4m4i77rwee4

Inhibition of return in static but not necessarily in dynamic search

Zhiguo Wang, Kan Zhang, Raymond M. Klein
2010 Attention, Perception & Psychophysics  
Visual search is a widely used paradigm in attention research. In a typical search task, participants are asked to search for a target among a group of distractors.  ...  When the search task is easy, the target "pops out" of the array, and RT is relatively unaffected by the number of items presented (set size).  ...  the next two experiments to look for evidence of IOR following dynamic search.  ... 
doi:10.3758/app.72.1.76 pmid:20045881 fatcat:hp6lbet62ncbxaxpctxvjaauza

CADLIVE optimizer: web-based parameter estimation for dynamic models

Kentaro Inoue, Kazuhiro Maeda, Yuki Kato, Shinpei Tonami, Shogo Takagi, Hiroyuki Kurata
2012 Source Code for Biology and Medicine  
This optimizer is integrated into the CADLIVE Dynamic Simulator to attain efficient simulation for dynamic models.  ...  Computer simulation has been an important technique to capture the dynamics of biochemical networks.  ...  Additional file 2: Instruction for the CADLIVE Optimizer. Additional file 3: Description of three example models.  ... 
doi:10.1186/1751-0473-7-9 pmid:22929413 pmcid:PMC3457844 fatcat:bamojybjjbcyhnly7uv54e4lpq

Static items are automatically prioritized in a dynamic environment

Yaïr Pinto, Christian N. L. Olivers, Jan Theeuwes
2008 Visual Cognition  
When you are looking for a friend in a crowd it helps when he or she waves. This example suggests that dynamic items attract attention.  ...  In a visual search task where all items, except one, were dynamic, the dynamic items could be ignored and the static item could be efficiently detected.  ...  Figure 4 . 4 Mean RTs for each condition of Experiment 3 (relevant, irrelevant, static target and irrelevant, dynamic target) as a function of set size when the dynamics were set to moving.  ... 
doi:10.1080/13506280701575375 fatcat:pjpilhlpwrgbhawvh3xlkcjgqy

Visual search is guided by prospective and retrospective memory

Matthew S. Peterson, Melissa R. Beck, Miroslava Vomela
2007 Perception & Psychophysics  
Interestingly, in Experiment 2, revisitations in the dynamic condition occurred later in the search for set size 16 than in the search for set size 8.  ...  ratio expected for serial search (2.16 for static and 1.99 for dynamic).  ...  Although the RT slopes for the dynamic displays are higher in Experiment 1 than in Experiment 2, the differing error rates, particularly the interaction with set size in Experiment 2, make comparing search  ... 
doi:10.3758/bf03194459 pmid:17515222 fatcat:vxcsraa7cjbknpv62zzdjnqhd4

Selecting from dynamic environments: Attention distinguishes between blinking and moving

2008 Perception & Psychophysics  
Note that with this double set size analysis, search slopes in the blinking-among-blinking condition were not linear; the search slope for set sizes 9 and 17 was higher than that for set sizes 17 and 33  ...  Hence, it would be sufficient for observers to merely adopt a more general attentional set for dynamic targets.  ... 
doi:10.3758/pp.70.1.166 pmid:18306970 fatcat:x7mmvar72fdihkwpzjfgn6dxwm

An Improved Dynamic Z* Algorithm for Rapid Replanning of Energy-Efficient Paths

Nuwan Ganganath, Chi-Tsun Cheng, Chi K. Tse
2015 2015 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery  
This paper proposes some vital improvements to Dynamic Z* by optimizing the use of previous search results in replanning.  ...  Recently proposed Dynamic Z* heuristic search algorithm enables mobile robots navigating on uneven terrains to replan energy-efficient paths using previous search results whenever an obstacle is encountered  ...  As a solution for energy-efficient path planning problems in dynamic outdoor environments, Dynamic Z* heuristic search algorithm was proposed in [10] .  ... 
doi:10.1109/cyberc.2015.52 dblp:conf/cyberc/GanganathCT15 fatcat:scoykm4tgvhrlel3dcvxw4eigq

Losing the trees for the forest in dynamic visual search

Nicole L. Jardine, Cathleen M. Moore
2016 Journal of Experimental Psychology: Human Perception and Performance  
We asked what consequences representational updating has for visual search. In this dynamic visual search task, bars rotated around their central axis.  ...  Observers searched for a single episodic target state (oblique bar among vertical and horizontal bars). Search was efficient when the target display was presented as an isolated static display.  ...  Search was highly accurate for static displays but impaired for both the 3-and 11-frame dynamic displays.  ... 
doi:10.1037/xhp0000186 pmid:26689307 pmcid:PMC4840043 fatcat:6nlqf34su5fabhndza64aaqhpa

Incremental refinement of solutions for multiple objective optimization problems

Carlos Eduardo Mariano, Victor Hugo Alcocer, Eduardo F. Morales
2007 Proceedings of the 9th annual conference on Genetic and evolutionary computation - GECCO '07  
Searching for new solutions, from the last Pareto set, given the new values for the dynamic parameters, significantly reduces the convergence time.  ...  Agents start searching (adapting solutions) from the existing environments which correspond to the Pareto solutions obtained for the previous value for the dynamic parameters.  ...  Searching for new solutions, from the last Pareto set, given the new values for the dynamic parameters, significantly reduces the convergence time.  ... 
doi:10.1145/1276958.1277140 dblp:conf/gecco/MarianoAM07 fatcat:idge6vok4vhl5mp3rg62qqw6dy

The temporal dynamics of visual search: Evidence for parallel processing in feature and conjunction searches

Brian McElree, Marisa Carrasco
1999 Journal of Experimental Psychology: Human Perception and Performance  
Set size affected discrimination in both feature and conjunction searches but affected detection speed only in the latter.  ...  Implications for the role of attention in visual processing are discussed.  ...  We thank Cynthia Wei for her assistance in testing observers and performing data analysis.  ... 
doi:10.1037//0096-1523.25.6.1517 pmid:10641310 pmcid:PMC3313830 fatcat:aoanpy7j7ne7vpqhlfo66wsovu

All maximal independent sets and dynamic dominance for sparse graphs

David Eppstein
2009 ACM Transactions on Algorithms  
We describe algorithms, based on Avis and Fukuda's reverse search paradigm, for listing all maximal independent sets in a sparse graph in polynomial time and delay per output.  ...  We also describe new data structures for maintaining a dynamic vertex set S in a sparse or minor-closed graph family, and querying the number of vertices not dominated by S; for minor-closed graph families  ...  set: search(child) choose an ordering for graph's vertices compute LFMIS search(LFMIS) Order by greedily removing min-degree vertices: |S|=O(1) for sparse graphs therefore, can list independent  ... 
doi:10.1145/1597036.1597042 fatcat:pde4phvhbneb7ity7poaofav54
« Previous Showing results 1 — 15 out of 1,541,731 results