The aim of optimization methods is to identify the best results in search area. In this research, we focused on a mixture interior point method, opposite gradient and mean-variance mapping optimization, named IPOG-MVMO, where solutions can be obtained from field cost function constraint manifold. process was divided into three main phases. first phase, method applied for local searching. Second...

In this paper, we first build a manually annotated named entity corpus of Mongolian. Then, we propose three morphological processing methods and study comprehensive features, including syllable features, lexical features, context features, morphological features and semantic features in Mongolian named entity recognition. Moreover, we also evaluate the influence of word cluster features on the ...

This paper introduces the family traveling salesperson problem (FTSP), a variant of the generalized traveling salesman problem. In the FTSP, a subset of nodes must be visited for each node cluster in the graph. The objective is to minimize the distance traveled. We describe an integer programming formulation for the FTSP and show that the commercial-grade integer programming solver CPLEX 11 can...

The paper describes one of the most researched techniques in solving Constraint Satisfaction Problems (CSPs) searching which is well-suited for declarative (non-procedural) implementation in a new programming paradigm named Control Network Programming, and how this can be achieved using the tools for dynamic computation control. Some heuristics for variable and value ordering in backtracking al...

Browsing and finding relevant information for Bangladeshi laws is a challenge faced by all law students and researchers in Bangladesh, and by citizens who want to learn about any legal procedure. Some law archives in Bangladesh are digitized, but lack proper tools to organize the data meaningfully. We present a text visualization tool that utilizes machine learning techniques to make the search...

This paper, submitted as an entry for the NERSSEAL-2008 shared task, describes a system build for Named Entity Recognition for South and South East Asian Languages. Our paper combines machine learning techniques with language specific heuristics to model the problem of NER for Indian languages. The system has been tested on five languages: Telugu, Hindi, Bengali, Urdu and Oriya. It uses CRF (Co...

This paper presents how to mine formulation rules from a named organization corpus. The TEIRESIAS algorithm, which is widely used in bioinformatics domain, is adopted. The experimental results based on MET2 test bed show that the approach of regarding the morpheme of a keyword as a cluster is the best, the approach of regarding all the keywords as the same cluster is the next, and the approach ...

We study work-stealing based scheduling on a cluster of nodes with CPUs and GPUs. In particular, we evaluate locality aware scheduling in the context of distributed shared memory style programming, where the user is oblivious to data placement. Our runtime maintains a distributed map of data resident on various nodes and uses it to estimate the affinity of work to different nodes to guide sched...

ABSTRACT: Multi-manned assembly lines are widely used in manufacturing industries that process a high-volume of large-sized workpieces. At each workstation there multiple workers simultaneously performing different tasks with the possibility interfering other, leading to an increase processing task times. This paper studies this type problem: multi-manned line balancing problem dependent times ...

The Fifteen Puzzle problem is one of the most classical problems that has captivated mathematics enthusiasts for centuries. This mainly because huge size state space with approximately 1013 states have to be explored, and several algorithms been applied solve instances. In this paper, manage large space, bidirectional A* (BA*) search algorithm three heuristics, such as Manhattan distance (MD), ...