Cornelis Hoede

Center for Discrete Mathematics and Theoretical Computer Science

Author Statistics

Papers

Citation

H-Index

i-10 index

Research Trends

Author Order

Document Type

Co-Authors

Xueliang Li

Nankai University

Ligong Wang

Northwestern Polytechnical University

Gerard J.M. Smit

University of Twente

Hajo Broersma

University of Twente

Yuanqing Guo

Shanghai Changning Maternity and Infant Health Hospital

Sri Nurdiati

IPB University

Theo Driessen

University of Twente

Georg Still

University of Twente

Hao Sun

Shandong Management University

F. Göbel

University of Twente

Cooperative Institutions

University of Twente

Northwestern Polytechnical University

Center for Discrete Mathematics and Theoretical Computer Science

Nankai University

Chinese Academy of Sciences

Jilin University

Embedded Systems (United States)

University of Applied Sciences Utrecht

Information Technology University

Hudson Institute

Author Statistics

Papers

Citation

H-Index

i-10 index

Research Field

A Multi-Pattern Scheduling Algorithm

Yuanqing Guo Cornelis Hoede Gerard J.M. Smit

In a coarse-grained reconfigurable architecture, the function of resources such as Arithmetic Logic Units (ALU) can be reconfigured at run-time. The traditional scheduling algorithms always assume a fixed resource pattern. In this paper, we propose an efficient scheduling algorithm assuming that different resource patterns are given. The multi-pattern scheduling algorithm is based on the list scheduling algorithm. The complexity of the proposed algorithm is linear in the number of given patterns.

Source

Cite

Citations (5)

Clique polynomials and independent set polynomials of graphs

Discrete Mathematics (1994)

Cornelis Hoede Xueliang Li

Clique

10.1016/0012-365x(94)90163-5

Cite

Citations (161)

A graph theoretical analysis of certain aspects of Bahasa Indonesia

Cornelis Hoede Sri Nurdiati

In this paper the theory of knowledge graphs is applied to some characteristic features of the Indonesian language. The characteristic features to be considered are active and passive form of verbs and the derived nouns

Source

Cite

Citations (4)

A pattern selection algorithm for multi-pattern scheduling

International Parallel and Distributed Processing Symposium (2006)

Yuanqing Guo Cornelis Hoede Gerard J.M. Smit

The multi-pattern scheduling algorithm is designed to schedule a graph onto a coarse-grained reconfigurable architecture, the result of which depends highly on the used patterns. This paper presents a method to select a near-optimal set of patterns. By using these patterns, the multi-pattern scheduling will result in a better schedule in the sense that the schedule will have fewer clock cycles.

10.5555/1898953.1899149

Cite

Citations (7)

Magic Labelings of Graphs.

Ars Combinatoria (1999)

F. Göbel Cornelis Hoede

Source

Cite

Citations (14)

On solidarity values

Cornelis Hoede

In this note the concept of solidarity value in cooperative game theory is discussed. The value proposed by Nowak \& Radzik is analyzed in terms of shifts of c-diagrams. The value is shown to be equal to the Shapley value for a shifted game. A general approach to a theory of solidarity is developed in terms of keep and give vectors.

Shapley Value

Value (mathematics)

Cooperative game theory

Source

Cite

Citations (0)

A CO-MARGINALISTIC CONTRIBUTION VALUE FOR SET GAMES

International Game Theory Review (2001)

Hao Sun Shenggui Zhang Xueliang Li Theo Driessen Cornelis Hoede

In this paper, a new value for set games, named co-marginalistic contribution value, is characterised by the standard axioms of global efficiency and equal treatment property, and another axiom of co-coalitional marginalistic monotonicity, which is a modification of the axiom of monotonicity. The co-marginalistic contribution value for set games is analogous to the solidarity value for n-person TU-games. Since the co-marginalistic contribution value does not satisfy the axiom of additivity, the proof of the characterisation is much different from that for TU-games.

Value (mathematics)

Axiom independence

Urelement

Zermelo–Fraenkel set theory

Shapley Value

Constructive set theory

10.1142/s0219198901000452

Cite

Citations (4)

Measures in social sciences

Cornelis Hoede

In the series Basic Concepts in Social Sciences a list of 79 concepts was given. The last part of that list consisted of 10 concepts concerning measures. Verbal definitions of these measures were considered as a preparation of mathematical definitions. In this paper these mathematical definitions will be discussed.

Source

Cite

Citations (0)

A Column Arrangement Algorithm for a Coarse-grained Reconfigurable Architecture

Yuanqing Guo Cornelis Hoede Gerard J.M. Smit

In a coarse-grained reconfigurable architecture, the functions of resources such as Arithmetic Logic Units (ALUs) can be reconfigured. Unlike the programmability of a general purpose processor, the programmability of a coarse-grained reconfigurable architecture is limited. The limitation might be the number of different patterns or the number of different configurations of each ALU. This paper presents a column arrangement algorithm to sort the elements of patterns to reduce the number of configurations of each reconfigurable ALU. The experimental results show that this algorithm leads to nearly optimal results.

Source

Cite

Citations (4)

Hard graphs for the maximum clique problem

Discrete Mathematics (1988)

Cornelis Hoede

Clique-sum

Clique problem

Indifference graph

Maximal independent set

Split graph

Cograph