scholarly journals Indirect anaphora resolution as semantic path search

2005 ◽  
Author(s):  
James Fan ◽  
Ken Barker ◽  
Bruce Porter
Keyword(s):  
Anaphora Resolution ◽  
Path Search

Best Neighbor Heuristic Search for Finding Minimum Paths in Transportation Networks

1998 ◽  
Vol 1651 (1) ◽  
pp. 48-52 ◽  
Author(s):  
Jeffrey L. Adler
Keyword(s):  
Heuristic Search ◽  
Transportation Networks ◽  
Transportation Network ◽  
Search Problems ◽  
A Algorithm ◽  
Running Time ◽  
Search Effort ◽  
Wide Range ◽  
Path Search ◽  
Sparse Networks

For a wide range of transportation network path search problems, the A* heuristic significantly reduces both search effort and running time when compared to basic label-setting algorithms. The motivation for this research was to determine if additional savings could be attained by further experimenting with refinements to the A* approach. We propose a best neighbor heuristic improvement to the A* algorithm that yields additional benefits by significantly reducing the search effort on sparse networks. The level of reduction in running time improves as the average outdegree of the network decreases and the number of paths sought increases.

Application of High Performance Parallel Computing Based on GPU

2013 ◽  
Vol 411-414 ◽  
pp. 585-588
Author(s):  
Liu Yang ◽  
Tie Ying Liu
Keyword(s):  
Particle Swarm Optimization ◽  
Parallel Computing ◽  
Parallel Computation ◽  
High Performance ◽  
Search Process ◽  
Search Rate ◽  
Swarm Optimization ◽  
Path Search ◽  
Parallel Feature ◽  
Time And Space Complexity

This paper introduces parallel feature of the GPU, which will help GPU parallel computation methods to achieve the parallelization of PSO parallel path search process; and reduce the increasingly high problem of PSO (PSO: Particle Swarm Optimization) in time and space complexity. The experimental results show: comparing with CPU mode, GPU platform calculation improves the search rate and shortens the calculation time.

Crossover: a unified view

1998 ◽  
Vol 34 (1) ◽  
pp. 73-124 ◽  
Author(s):  
RUTH KEMPSON ◽  
DOV GABBAY
Keyword(s):  
Language Processing ◽  
Deductive System ◽  
Anaphora Resolution ◽  
Unified View ◽  
On Line

This paper informally outlines a Labelled Deductive System for on-line language processing. Interpretation of a string is modelled as a composite lexically driven process of type deduction over labelled premises forming locally discrete databases, with rules of database inference then dictating their mode of combination. The particular LDS methodology is illustrated by a unified account of the interaction of wh-dependency and anaphora resolution, the so-called ‘cross-over’ phenomenon, currently acknowledged to resist a unified explanation. The shift of perspective this analysis requires is that interpretation is defined as a proof structure for labelled deduction, and assignment of such structure to a string is a dynamic left-right process in which linearity considerations are ineliminable.

Sign in / Sign up

Export Citation Format

Share Document