please send for me source code gsa
[email protected] ....etc

[:=Read Full Message Here=:]

Please provide the heuristic based query processing for large rdf graphs using cloud computing coding and documentation
....etc

[:=Read Full Message Here=:]

A Novel Algorithm for Hiding Sensitive Frequent Itemsets
Chih-Chia Weng, Shan-Tai Chen*
, Yuan-Chung Chang
Dept. of Information Science, Chung Cheng Institute of Technology, National Defense University


*
Dept. of Information Science, Chung Cheng Institute of Technology, National Defense University
No. 190, Sanyuan 1st
St., Tashi, Taoyuan, Taiwan, R.O.C.
Tel : +886-3-3809331 ext 209 (O)
Fax : +886-3-3806737
E-mail : [email protected]


Abstracts - With rapid advance of the network and data mini ....etc

[:=Read Full Message Here=:]

Abstract—IEEE 802.16 OFDMA systems have gained much attention for their ability to support high transmission rates and broadband access services. For multiuser environments, IEEE 802.16 OFDMA systems require a resource allocation algorithm to use the limited downlink resource efficiently. The IEEE 802.16 standard defines that resource allocation should be performed with a rectangle region of slots, called a burst. However, the standard does not specify how to construct bursts. In this paper, we propose a heuristic burst construction algorithm ....etc

[:=Read Full Message Here=:]

Abstract:
Given an undirected, unweighted graph G = (V, E), the minimum vertex cover problem is a subset of whose cardinality is minimum subject to the premise that the selected vertices cover all edges in the graph. There are various other algorithms that follows heuristic based approaches, but using those approaches we are not able to find optimal solution always in the same manner Greedy algorithms solves the same problems but some problems have no efficient result, but up to a certain extend the Greedy algorithm ....etc

[:=Read Full Message Here=:]

Heuristic and Metaheuristic Algorithms


Heuristic algorithms – What are they?

Wikipedia says:

In computer science, a heuristic is a technique designed to solve a problem that ignores whether the solution can be proven to be correct, but which usually produces a good solution or solves a simpler problem that contains or intersects with the solution of the more complex problem.

Heuristics are intended to gain computational performance or concep ....etc

[:=Read Full Message Here=:]

This paper provides a heuristic algorithm for an NP-Complete problem. It is a result of a research on an NP-Complete problem known as Clique problem. I have succeeded in developing an algorithm which will give the maximum size Clique, for a given graph G, as its output. This paper explains the algorithm, its time complexity, applications and its implementation in C. This is a research paper based on an interesting class of problems known as ?NP-Complete? problems. No polynomial-time algorithm has yet been discovered for an NP-Complete problem, ....etc

[:=Read Full Message Here=:]

ARTIFICIAL INTELLIGENCE IN VIRUS DETECTION AND RECOGNITION

Parvathy Nair & Parvathy.R.Nair
S8-Computer Science Department
Mohandas College of Engineering and Technology
Trivandrum.




Abstract
Artificial intelligence (AI) techniques have played increasingly important role in virus detection. At present, some
principal artificial intelligence techniques applied in virus detection are proposed, including heuristic technique,
data ....etc

[:=Read Full Message Here=:]

SEE GRID database and pathology filter



Presented BY
M.SHALEM RAJ
III ECE (05R81A0435)
SRI SUNFLOWER COLLEGE OF ENGG. AND TECHNOLOGY


Abstract
SEE-GRID is based on the SEE++ software for the biomechanical simulation of the human eye. The goal of SEE-GRID is to adapt and to extend SEE++ in several steps and to develop an efficient grid-based tool for Evidence Based Medicine'', which supports the surgeons to choose the best/optimal surgery techniques in case of the treatments of diffe ....etc

[:=Read Full Message Here=:]

Abstract
SEE-GRID is based on the SEE++ software for the biomechanical simulation of the human eye. The goal of SEE-GRID is to adapt and to extend SEE++ in several steps and to develop an efficient grid-based tool for Evidence Based Medicine'', which supports the surgeons to choose the best/optimal surgery techniques in case of the treatments of different syndromes of strabismus. This paper consists of some speed up curves incase of the calculation of the brainstem pattern wit 45 points. This paper also outline ....etc

[:=Read Full Message Here=:]

Presented by:Sougata Sinha
Use of A algorithm for obstacle avoidance

Abstract
A* algorithm is basically a path finding algorithm based on Artificial Intelligence. It is used nowadays extensively in the field of game programming and robotics to figure out an optimum path in an environment full of obstacles. The A* algorithm can be used in both 2-D and 3-D terrain. Each terrain is represented as a map. The beauty of the a ....etc

[:=Read Full Message Here=:]

ABSTRACT
Fuzzy logic, a relatively new cutting edge technology, is nowadays gaining popularity. Fuzzy control is a practical alternative for a variety of challenging control applications since it provides a convenient method for constructing no-linear controllers via the use of heuristic information. Such heuristic information may come from an operator who has acted as a human in the loop controller for a process. A fuzzy controller emulates human decision-making process. Fuzzy control provides a user-friendly formalism for ....etc

[:=Read Full Message Here=:]

In the age of multimedia and high-speed networks, multicast is one of the mechanisms by which the power of the Internet can be further harnessed in an efficient manner. It has been increasingly used by various continuous media applications such as teleconferencing, distance learning, and voice & video transmission. Compared with unicast and broadcast, multicast can save network bandwidth and make transmission more efficient. In this seminars, we will review the history of the multicast, present you several existing multicast routing algorithms ....etc

[:=Read Full Message Here=:]

IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 16, NO. 1, FEBRUARY 2008 105
Two Techniques for Fast Computation of
Constrained Shortest Paths
Shigang Chen, Member, IEEE, Meongchul Song, Member, IEEE, and Sartaj Sahni, Fellow, IEEE
Abstract—Computing constrained shortest paths is fundamental
to some important network functions such as QoS routing, MPLS
path selection, ATM circuit routing, and traffic engineering. The
problem is to find the cheapest path that satisfies certain constraints.
In particular, finding the cheapest delay-constraine ....etc

[:=Read Full Message Here=:]

HEURISTIC ALGORITHMS FOR DESIGNING SELF-REPAIRING PROTECTION TREES IN MESH NETWORKS


ABSTRACT:

Protection trees have been used in the past for restoring multicast and Uni-cast traffic in networks in various failure scenarios. In this paper we focus on shared self-repairing trees for page link protection in Uni-cast mesh networks. Shared protection trees have been proposed as a relatively simple approach that is easy to reconfigure and could provide sub-second restoration time ....etc

[:=Read Full Message Here=:]