The term “plea bargaining”has become a label often used to describe a series of disparate mechanisms to investigate,prosecute,and adjudicate criminal liability. For some,plea bargaining is the indispensable tool to address criminal conduct,while for others it has become a symbol of coercion and injustice. The purpose of this Article will be to distinguish the very different mechanisms that are ...

Different attempts have been made to answer Reich's question why the majority of those who are hungry don't steal and why the majority of those who are exploited don't strike. The two most influential approaches have been the ideological one and the gunman theory. The gunman theory seems to have the upper hand in that it not only explains many cases of successful oppression by a minority of a m...

This article proposes an heuristics for the automatic computation of interactions in reactive multi-agent system. It describes first the Interac-DEC-POMDP formalism and then focuses on a algorithm based on reinforcement learning techniques and distribution of individual rewards among agents to build interaction and collective behaviour in a sub-class of DEC-POMDP. These techniques produce adapt...

Crossing minimization problem in a bipartite graph is a well-known NP-Complete problem. Drawing the directed/undirected graphs such that they are easy to understand and remember requires some drawing aesthetics and crossing minimization is one of them. In this paper, we investigate an intelligent evolutionary technique i.e. Genetic Algorithm (GA) for bipartite drawing problem (BDP). Two techniq...

Techniques that combine myopic problem specific methods and a meta-strategy, which guides the search out of local optimum, are currently providing the best results. Such hybrid methods are known as iterated local search algorithms or meta-heuristics. Despite the good results achieved by these methods the inability of many current meta-heuristics to provide a wide exploration of the search space...

Various (tableau) optimization techniques have been integrated into OWL reasoners to speed up reasoning. Many of the techniques rely on heuristics that have been manually fine tuned for achieving a good performance but might fail dramatically when encountering ontologies exhibiting unexpected design patterns. A typical example are heuristics applied to disjunctions in order to select a disjunct...

Local search techniques have attracted considerable interest in the AI community since the development of GSAT for solving large propositional SAT problems. Newer SAT techniques, such as the Discrete Lagrangian Method (DLM), have further improved on GSAT and can also be applied to general constraint satisfaction and optimisation. However, little work has applied local search to MAX-SAT problems...

Cluster ensembles are deemed to be better than single clustering algorithms for discovering complex or noisy structures in data. Various heuristics for constructing such ensembles have been examined in the literature, e.g., random feature selection, weak clusterers, random projections, etc. Typically, one heuristic is picked at a time to construct the ensemble. To increase diversity of the ense...

A significant body of literature has explored various research directions in hyper-heuristics (which can be thought as heuristics to choose heuristics). In this paper we define a graph based hyper-heuristic (GHH) framework and compare the performance of a number of local search based searching algorithms as the high level heuristics. They are used to search upon permutations of low level graph ...

Mobile Ad hoc Network (MANET) is an autonomous, self-configuring and infrastructure-less system in which various mobile nodes are connected by wireless links. In Mobile Ad Hoc Network (MANET), various routing protocols are there like AODV, DSDV, TORA, DSR etc. Due to the nature of changing topology and infrastructure less in MANETs there are various issues and constraints which affect the perfo...