The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying 701 –
720 of
4977
Motivation for this paper are classification problems in which data can not be clearly divided into positive and negative examples, especially data in which there is a monotone hierarchy (degree, preference) of more or less positive (negative) examples. We present a new formulation of a fuzzy inductive logic programming task in the framework of fuzzy logic in narrow sense. Our construction is based on a syntactical equivalence of fuzzy logic programs FLP and a restricted class of generalised annotated...
This note is concerned with the bicriteria scheduling problem on a series-batching machine to minimize maximum cost and makespan. An O(n5) algorithm has been established previously. Here is an improved algorithm which solves the problem in O(n3) time.
Many real-world scheduling problems can be modeled as Multi-mode Resource Constrained Project Scheduling Problems (MRCPSP). However, the MRCPSP is a strong NP-hard problem and very difficult to be solved. The purpose of this research is to investigate a more efficient alternative based on ant algorithm to solve MRCPSP. To enhance the generality along with efficiency of the algorithm, the rule pool is designed to manage numerous priority rules for MRCPSP. Each ant is provided with an independent...
A vertex i of a graph G = (V,E) is said to be controlled by if the majority of the elements of
the neighborhood of i (including itself) belong to M. The set
M is a monopoly in G if every vertex is
controlled by M. Given a set and two graphs
G1 = () and G2 = () where , the
monopoly verification problem (mvp) consists of deciding
whether there exists a sandwich graph G = (V,E) (i.e., a graph
where ) such that M is a monopoly
in G = (V,E). If the answer to the mvp is No, we then
consider...
A vertex i of a graph G = (V,E) is said to be controlled by if the majority of the elements of
the neighborhood of i (including itself) belong to M. The set
M is a monopoly in G if every vertex is
controlled by M. Given a set and two graphs
G1 = () and G2 = () where , the
monopoly verification problem (mvp) consists of deciding
whether there exists a sandwich graph G = (V,E) (i.e., a graph
where ) such that M is a monopoly
in G = (V,E). If the answer to the mvp is No, we then
consider...
The concept of usability of man-machine interfaces is usually judged in terms of a number of aspects or attributes that are known to be subject to some rough correlations, and that are in many cases given different importance, depending on the context of use of the application. In consequence, the automation of judgment processes regarding the overall usability of concrete interfaces requires the design of aggregation operators that are capable of modeling approximate or ill-defined interactions...
Currently displaying 701 –
720 of
4977