• No results found

[PDF] Top 20 Exploiting Problem Structure in Pathfinding

Has 10000 "Exploiting Problem Structure in Pathfinding" found on our website. Below are the top 20 most common "Exploiting Problem Structure in Pathfinding".

Exploiting Problem Structure in Pathfinding

Exploiting Problem Structure in Pathfinding

... is different from run to run. There are some factors such as JIT (Just-In-Time) compilation and optimization in the virtual machine driven by timer-based method sampling, thread scheduling, garbage collection, or some ... See full document

88

Exploiting Conversation Structure in Unsupervised Topic Segmentation for Emails

Exploiting Conversation Structure in Unsupervised Topic Segmentation for Emails

... these problems. First, we present an email corpus annotated with topics and evaluate annotator agree- ment. Second, we adopt a set of metrics to mea- sure the local and global structural similarity be- tween two ... See full document

11

Exploiting Structure for Scalable and Robust Deep Learning

Exploiting Structure for Scalable and Robust Deep Learning

... Summary We study the problem of modeling spatiotemporal trajectories over long time horizons using expert demonstrations. For instance, in sports, agents often choose action sequences with long-term goals in mind, ... See full document

141

Exploiting Domain Structure for Named Entity Recognition

Exploiting Domain Structure for Named Entity Recognition

... We evaluated our domain-aware approach to NER on the problem of gene recognition in biomedical literature. The data we used is from BioCreAtIvE Task 1B (Hirschman et al., 2005). We chose this data set because it ... See full document

8

Performance Evaluation of Pathfinding Algorithms

Performance Evaluation of Pathfinding Algorithms

... Every year many research papers are published in every field. In computer science, the work in research papers is supported by experimental data and analysis of that data. Then the results are concluded and presented in ... See full document

69

Exploiting Structure for Event Discovery Using the MDI Algorithm

Exploiting Structure for Event Discovery Using the MDI Algorithm

... Accurately identifying events in unstructured text is an important goal for many applications that require natural language understanding. There has been an increased focus on this problem in recent years. The ... See full document

6

Exploiting Discourse Structure for Spoken Dialogue Performance Analysis

Exploiting Discourse Structure for Spoken Dialogue Performance Analysis

... discourse structure but flatten the discourse ...discourse structure are also common for other SDS tasks like predictive models of speech rec- ognition problems (Gabsdil and Lemon, ... See full document

9

Exploiting Structure in Data: Depth and Dynamics.

Exploiting Structure in Data: Depth and Dynamics.

... We hence propose a novel generator network which generates a sparse vector of coefficients for each image patch instead of generating the entire image. Full-size output images are assembled by tiling the image patches, ... See full document

88

Exploiting Structure in Parsing to 1 Endpoint Crossing Graphs

Exploiting Structure in Parsing to 1 Endpoint Crossing Graphs

... search problem is intractable in the general case, we consider its restriction to the class of 1- endpoint-crossing (1ec) graphs, which has high coverage on standard data ... See full document

10

Exploiting Graph Structure for Accelerating the Calculation of Shortest Paths in Wordnets

Exploiting Graph Structure for Accelerating the Calculation of Shortest Paths in Wordnets

... This paper presents an approach for sub- stantially reducing the time needed to cal- culate the shortest paths between all con- cepts in a wordnet. The algorithm exploits the unique “star-like” topology of word- nets to ... See full document

8

Exploiting Social Network Structure for Person to Person Sentiment Analysis

Exploiting Social Network Structure for Person to Person Sentiment Analysis

... We develop (Sec. 3) a graphical model that syn- thesizes network and linguistic information to make more and better predictions about both. The objec- tive of the model is to predict A’s opinion of B using a synthesis of ... See full document

14

Energy optimal steering of transitions through a fractal basin boundary

Energy optimal steering of transitions through a fractal basin boundary

... complicated structure of the paths inside the fractal boundary is determined by a hierarchy of homoclinic original sad- ...By exploiting an analogy between the control problem and the concept of an ... See full document

6

Structured penalties for functional linear models—partially empirical eigenvectors for regression

Structured penalties for functional linear models—partially empirical eigenvectors for regression

... ometric structure, or local correlation, into the analysis. This structure is inherent in the output from an increasing number of biomedical technolo- gies, and a functional linear model is often used to ... See full document

31

Exploiting the instability of smart structure for reconfiguration

Exploiting the instability of smart structure for reconfiguration

... Figure 2 shows the deflection of buckled beam during reconfiguration between two unstable buckling modes ( , ), it is distinct that this transition goes through a stable mode ( ). Moreover, in order to explain that ... See full document

16

Classifying and exploiting structure in multivariate extremes

Classifying and exploiting structure in multivariate extremes

... The problem of determining the extremal dependence structure of variables has been recently studied elsewhere in the ...dependence structure of the nested logistic distribution of Tawn ...by ... See full document

218

Pricing exotic derivatives exploiting structure

Pricing exotic derivatives exploiting structure

... steps and millions of node calculations. American options are considered in [30], where the author proposes an alternative characterization of the early exercise premium that is valid for any Markovian and diffusive ... See full document

31

Pathfinding by demand sensitive map abstraction

Pathfinding by demand sensitive map abstraction

... To say games are time constrained, means a game must display informa- tion at a constant speed which is usually above 25 frames per second (modern games run 60 frames per second or more). More frames per second implies ... See full document

90

Direction oriented pathfinding in video games

Direction oriented pathfinding in video games

... As mentioned above, finding the shortest path on an n-sided-poly-based navigation mesh is still a problem. This research intends to adopt a funnel-like algorithm to n-sided-poly-based navigation mesh ... See full document

11

Multi-Objective Pathfinding in Dynamic Environments

Multi-Objective Pathfinding in Dynamic Environments

... Multi-Objective Pathfinding algorithm, as any solution that contains a single resource will still be displayed in the following ...Multi-Objective Pathfinding algorithm are ... See full document

114

Unilateral left tail anderson darling test based spectrum sensing with Laplacian noise

Unilateral left tail anderson darling test based spectrum sensing with Laplacian noise

... distributed or symmetrical weight functions in the KS, CM and AD are not the best candidate for the unilateral GoF test problem. The reason is that if the difference focuses more on the left tail (or right tail) ... See full document

11

Show all 10000 documents...

Related subjects