Research Article Classification of Textual E-Mail Spam
... sending technology on the other hand. By spam reports of Symantec in 2010, the average global spam rate for the year was 89.1%, with an increase of 1.4% compared with 2009. The proportion of spam sent from botnets was much higher for 2010, accounting for approximately 88.2% of all spam. Despite many ...
... sending technology on the other hand. By spam reports of Symantec in 2010, the average global spam rate for the year was 89.1%, with an increase of 1.4% compared with 2009. The proportion of spam sent from botnets was much higher for 2010, accounting for approximately 88.2% of all spam. Despite many ...
Distributed Stochastic Search for Constraint Satisfaction and Optimization:
... parallel executions among neighboring processes. When the level of local activities is high, so is the degree of parallel executions. To change the degree of parallel executions, an agent may switch to a different DSA algorithm, or change the probability that controls the likelihood of updating its ...
... parallel executions among neighboring processes. When the level of local activities is high, so is the degree of parallel executions. To change the degree of parallel executions, an agent may switch to a different DSA algorithm, or change the probability that controls the likelihood of updating its ...
AAAI Proceedings Template
... [Fogel, 2006]: theoretical and empirical. The theoretical approach is used to search through algorithms to seek the mathematical truth about them, while the empirical approach is used to examine evolutionary algorithms by statistical means. Alternatively, by creating a population of individuals, app ...
... [Fogel, 2006]: theoretical and empirical. The theoretical approach is used to search through algorithms to seek the mathematical truth about them, while the empirical approach is used to examine evolutionary algorithms by statistical means. Alternatively, by creating a population of individuals, app ...
Notes on the Periodically Forced Harmonic Oscillator
... is modulated by a low frequency oscillation. In Figure 1, we consider an example where F = 1, m = 1, and ω0 = 3. In the first three graphs, the solid lines are y(t) given by (4), and the dashed lines show the envelope or modulation of the amplitude of the solution. Note that the vertical scale is di ...
... is modulated by a low frequency oscillation. In Figure 1, we consider an example where F = 1, m = 1, and ω0 = 3. In the first three graphs, the solid lines are y(t) given by (4), and the dashed lines show the envelope or modulation of the amplitude of the solution. Note that the vertical scale is di ...
The adversarial stochastic shortest path problem with unknown
... then makes a transition: the next state of the Markovian environment depends stochastically on the current state and the chosen action, and the other part has an autonomous dynamic which is not influenced by the learner’s actions or the state of the Markovian environment. After this transition, the ...
... then makes a transition: the next state of the Markovian environment depends stochastically on the current state and the chosen action, and the other part has an autonomous dynamic which is not influenced by the learner’s actions or the state of the Markovian environment. After this transition, the ...
Intrusion Detection Using Data Mining Along Fuzzy Logic and
... some uncertain or fuzzy information that has to be processed. A part from being fuzzy in nature the information could be very large requiring data mining techniques for extracting the data. As the data for extracting has to follow certain rules, we need to have certain mechanism to pick up best poss ...
... some uncertain or fuzzy information that has to be processed. A part from being fuzzy in nature the information could be very large requiring data mining techniques for extracting the data. As the data for extracting has to follow certain rules, we need to have certain mechanism to pick up best poss ...
Planning with Specialized SAT Solvers
... increased the performance still further, now surpassing the performance of best existing planners based on any search method. This second variant differs in two respects. First, its depth-first search is not terminated after one action is found, but proceeds further to identify several actions (10 i ...
... increased the performance still further, now surpassing the performance of best existing planners based on any search method. This second variant differs in two respects. First, its depth-first search is not terminated after one action is found, but proceeds further to identify several actions (10 i ...
CPSC445_term_projects_2008-v2
... problem you addressed, your approach, and a summary of your results/conclusions. If you wish, you can work in teams of 2-4 people. But if you select to do a multi person project, you must accomplish proportionally more than a single person would. Each team may turn in one project report or individua ...
... problem you addressed, your approach, and a summary of your results/conclusions. If you wish, you can work in teams of 2-4 people. But if you select to do a multi person project, you must accomplish proportionally more than a single person would. Each team may turn in one project report or individua ...
Applying Dynamic Weight on Theta Star Path-finding
... path-length does not increase a lot while the run-time is considered shorter. [Figure 8. Figure 9] Although the increasing trend of trade-off rate is unstable, but there is a positive point that applying dynamic weight value still reduces the run-time of the algorithm and makes it run faster. [Table ...
... path-length does not increase a lot while the run-time is considered shorter. [Figure 8. Figure 9] Although the increasing trend of trade-off rate is unstable, but there is a positive point that applying dynamic weight value still reduces the run-time of the algorithm and makes it run faster. [Table ...
David Bergman Assistant Professor Operations and Information
... from Binary Decision Diagrams [Extended Abstract]. Proceedings of the International Conference on Principles and Practice of Constraint Programming (CP 2014) , volume 8656 of Lecture Notes in Computer Science, pages 903-907, 2014. D. Bergman, A.A. Cire, A. Sabharwal, H. Samulowitz, W.-J van Hoeve. D ...
... from Binary Decision Diagrams [Extended Abstract]. Proceedings of the International Conference on Principles and Practice of Constraint Programming (CP 2014) , volume 8656 of Lecture Notes in Computer Science, pages 903-907, 2014. D. Bergman, A.A. Cire, A. Sabharwal, H. Samulowitz, W.-J van Hoeve. D ...
Dynamic Programming
... Dynamic programming is a problem solving paradigm most often used to solve problems which require some measure of maximization or minimization. Divide-and-Conquer is a paradigm that recursively solves problems whose solution can be found in terms of smaller instances of itself. With Divide-and-Conqu ...
... Dynamic programming is a problem solving paradigm most often used to solve problems which require some measure of maximization or minimization. Divide-and-Conquer is a paradigm that recursively solves problems whose solution can be found in terms of smaller instances of itself. With Divide-and-Conqu ...
Signature Based Malware Detection is Dead
... The vast majority of AI solutions are based on signatures, heuristics, and behavioral analysis. Signatures and heuristics require the creation of a specific identifier, which attackers can easily evade by mutating their malware. Behavioral analysis depends upon allowing the malware to execute in ord ...
... The vast majority of AI solutions are based on signatures, heuristics, and behavioral analysis. Signatures and heuristics require the creation of a specific identifier, which attackers can easily evade by mutating their malware. Behavioral analysis depends upon allowing the malware to execute in ord ...
Getting More Out of the Exposed Structure in Constraint
... and of limiting the degree of vertices to be at most two. Taken separately, each of these parts is easy. The field of Operations Research has exploited such structural decomposition for a long time through the concept of problem relaxation which provides bounds on the value of the cost function. Lag ...
... and of limiting the degree of vertices to be at most two. Taken separately, each of these parts is easy. The field of Operations Research has exploited such structural decomposition for a long time through the concept of problem relaxation which provides bounds on the value of the cost function. Lag ...
Genetic algorithm
In the field of artificial intelligence, a genetic algorithm (GA) is a search heuristic that mimics the process of natural selection. This heuristic (also sometimes called a metaheuristic) is routinely used to generate useful solutions to optimization and search problems. Genetic algorithms belong to the larger class of evolutionary algorithms (EA), which generate solutions to optimization problems using techniques inspired by natural evolution, such as inheritance, mutation, selection, and crossover.