hierarchical fuzzy integral (FAHP) and Fuzzy multiple parameter decision-making (FMPDM) is introduced to optimize the selection of cluster heads to develop a distributed energy-efficient clustering algorithm. In FAHP…
theoretic characterization proposed a blur-robust algorithm whose main step involves solving simple convex optimization problems. To overcome this problem, the proposed technique is based on computer vision
estimation in a better way. Feature selection is very important in various pattern classification problems. The feature selector is applied to select a subset of features from the large ... selected subset should be…
main feature of cryptography is to work out with problems, which are associated with secrecy, authentication and integrity. Cryptography also, is related with the meaning of protocol. A protocol ... which is produce the…
comprising interior points of the problem arise due to non linear equation with optimization problem. The Cloud computing problem of the resources in terms of hardware constraints can be converted
data at a central location. Sensor networks pose a number of new conceptual and optimization problems such as location, deployment and tracking in that many applications rely on them ... needed information. Unbalanced…
each of which is associated with categorical information, e.g., restaurant, pub, etc., the optimal route query finds the shortest path that starts from the query point (e.g., a home ... scenario without such a total…
tremendous number of QA pairs have been accumulated in their repositories. But the major problem is the lack of diversity of the generated media data .It estimates the relevance scores ... similarities, the ranking list…
number of "approximate convex” parts. The minimum approximate decomposition is detailed as a discrete optimization problem by minimizing the amount of nonintersecting cuts. Two discernment guidelines are forced as…
such a vehicular content downloading system by modelling the downloading process as an optimization problem, and maximizing the overall system throughput. Our approach allows us to investigate the impact
type of clustering model that solves many normal clustering problems. The both novel subspace clustering algorithms known as fixed and optimal centroids are allows getting more profitable objects in database
gain in reliability, timeliness, and security. We formulate the tradeoff as an optimization problem for dynamically determining the best redundancy level to apply to multipath routing for intrusion tolerance
understand the implications of the online nature of the problem, we conduct competitive analysis and prove competitive ratios of optimal online deterministic algorithms for the single VM migration and dynamic
months. We are using a routing algorithm to calculate the shortest and optimized path. The common problem in Indian road system was poor road direction and qualities and PWD works ... when will it finished, we are going…
selection of the optimal path between any two nodes. Ensuring a data path to be valid for sufficiently longer period of time is a very difficult problem in MANET ... simple) expressions of these probabilities. Through…
monitors uncertain events in such data streams manipulates the top-k queries. Here the problem is that existing systems were not planned to allow query results sharing which in turn ... well-known possible worlds based…
problem for both inadequate memory and higher execution time. This paper presents an efficient hierarchical clustering method of mining large datasets with Map-Reduce. The method includes two optimization techniques
matching the feature using Discrete Particle Swarm Optimization (distance condition and angle condition). This optimization process helps in picking up three corresponding corner points detected in the Sensed and…
popular. Building high-quality cloud applications is a critical research problem. QoS rankings provide valuable information for making optimal cloud service selection from a set of functionally equivalent service…
initiated under sensor node allocation to sinks. A polynomial-time optimal algorithm is used for the origin problem. Extended Sink Scheduling Data Routing (E-SSDR) algorithm is used to schedule
power system operation and planning. The main objective of the DED problems is to determine the optimal combination of power outputs of all generating units so as to meet ... HGAPSO), which is generic population based…
this paper, we formalize the problem of Basic Graph Pat-tern (BGP) optimization for SPARQL queries and main memory graph implementations of RDF data. We define and analyze the characteristics
clustering objects, to avoid such a problem proposed the new Multi Objective (MO) clustering technique with combined form of Genetic clustering MO Optimization (GenClustMOO) and Archived Multi Objective Simulated…
For authors and organisers
Publish, present and keep up with your field
Find the right journal for your paper and submit your manuscript.