Search results for "A* algorithm"
showing 10 items of 2538 documents
Using Redundant Visual Information From Different Dimensions for Attentional Selection
2012
The present study investigated the use of redundant information for attentional selection of a visual object. Each display contained two overlapping objects, and participants had to report the color of the occluding object. A baseline condition did not require object selection because the objects were identical. A single-cue condition required object selection based on spatial arrangement (i.e., occlusion) because the objects had the same shape. A double-cue condition afforded object selection by occlusion and shape because the objects consistently differed in shape. Behavioral results showed that the redundant shape cue facilitated attentional selection, although participants were never s…
Role of Symbiosis in Evolution
2013
The biological relevance of the widespread prokaryote–eukaryote symbioses as a source of evolutionary innovation has been unveiled by the advent of the Genomic era, allowing deep knowledge on single or consortia uncultivable species. The establishment and maintenance of symbiosis are complex issues where partners’ fitness determines the evolutionary outcome. Comparative genomics allows to dissect the evolutionary process that begins with host invasion, takes the path from facultative to obligate symbiosis, and ends up in replacement or coexistence with new bacterial symbionts. Whole genomes of several intracellular bacterial symbionts have been sequenced, allowing the comparison among the d…
Mate choice for indirect genetic benefits: scrutiny of the current paradigm
2007
Summary 1Sexual selection through mate choice, and in particular female choice for indirect fitness benefits for their offspring, is a major paradigm that currently seems to enjoy almost unequivocal acceptance. A large body of theoretical work has been built to explain the evolution of mate choice in the absence of direct benefits, and the empiricists have enthusiastically verified the various assumptions and predictions of the theory. 2However, the relative importance of mate choice for indirect benefits in comparison to choice for direct benefits or to other mechanisms of sexual selection such as male–male competition or sensory exploitation remains a controversial issue, and this seems t…
Voxel-based General Voronoi Diagram for Complex Data with Application on Motion Planning
2020
One major challenge in Assembly Sequence Planning (ASP) for complex real-world CAD-scenarios is to find appropriate disassembly paths for all assembled parts. Such a path places demands on its length and clearance. In the past, it became apparent that planning the disassembly path based on the (approximate) General Voronoi Diagram (GVD) is a good approach to achieve these requirements. But for complex real-world data, every known solution for computing the GVD is either too slow or very memory consuming, even if only approximating the GVD.We present a new approach for computing the approximate GVD and demonstrate its practicability using a representative vehicle data set. We can calculate a…
Counting by Statistics on Search Trees: Application to Constraint Satisfaction Problems
1997
In 1975, Knuth proposed a simple statistical method for investigating search trees. We use this technique for estimating the number of solutions of constraint satisfaction problem CSP and boolean satisfiability problem SAT instances. We show that, depending on domain reductions, tree-based estimates have a lower variance than estimates based on uniform sampling from the search space. Nevertheless, because the variance remains extremely high in the general case, a confidence interval cannot be derived, but a lower bound of the number of solutions. These results are confirmed by many experiments.
Comment on: A critical analysis of the internal logic in the Life-Space Assessment (LSA) composite score and suggested solutions
2016
Background:An individual’s ability to live independently is commonly measured in health research interested in identifying risk factors associated with disablement processes. In order to inform clinical practice, population research has attempted to identify the contraction of “lived-space” by using various survey instruments.Problem:Studies assessing habitual movements over the environment with the Life-Space Assessment (LSA) survey instrument should carefully consider how the LSA Composite Score (LSA-CS) is computed. Until now, no publication has carefully delineated the assumptions guiding the internal logic used in the computation of the LSA-CS.Core argument:Because the internal logic o…
Linear-size suffix tries
2016
Suffix trees are highly regarded data structures for text indexing and string algorithms [MCreight 76, Weiner 73]. For any given string w of length n = | w | , a suffix tree for w takes O ( n ) nodes and links. It is often presented as a compacted version of a suffix trie for w, where the latter is the trie (or digital search tree) built on the suffixes of w. Here the compaction process replaces each maximal chain of unary nodes with a single arc. For this, the suffix tree requires that the labels of its arcs are substrings encoded as pointers to w (or equivalent information). On the contrary, the arcs of the suffix trie are labeled by single symbols but there can be Θ ( n 2 ) nodes and lin…
Table Compression
2016
Data Compression Techniques for massive tables are described. Related methodological results are also presented.
A grid representation for distributed virtual environments
2004
Fast Internet connections and the widespread use of high performance graphic cards are making Distributed Virtual Environments (DVE) very common nowadays. The architecture and behavior of these systems are very similar to new grid computing applications where concepts such as sharing and high scalability are extremely exploited. However, there are several key issues in these systems that should still be improved in order to design a scalable and cost-effective DVE system. One of these key issues is the partitioning problem. This problem consists of efficiently assigning clients (3-D avatars) to the arbiters (servers) in the system. As an alternative to the ad-hoc heuristic proposed in the l…
Fully Automatic Trunk Packing with Free Placements
2010
We present a new algorithm to compute the volume of a trunk according to the SAE J1100 standard. Our new algorithm uses state-of-the-art methods from computational geometry and from combinatorial optimization. It finds better solutions than previous approaches for small trunks.