Sciweavers

1209 search results - page 88 / 242
» On the Resilience of Classes to Change
Sort
View
DAM
2006
88views more  DAM 2006»
15 years 6 months ago
NP-completeness results for edge modification problems
The aim of edge modification problems is to change the edge set of a given graph as little as possible in order to satisfy a certain property. Edge modification problems in graphs...
Pablo Burzyn, Flavia Bonomo, Guillermo Durá...
JSW
2007
112views more  JSW 2007»
15 years 6 months ago
A Framework for Design Engineering Education with Workflow-based e-Learning System
—Education of design engineering has started to change in response to the advancement of computer technology. This paper proposes a new design engineering educational framework u...
Kazuo Hiekata, Hiroyuki Yamato, Piroon Rojanakamol...
CN
2004
86views more  CN 2004»
15 years 6 months ago
Management of abusive and unfair Internet access by quota-based priority control
In a free of charge or flat-rate Internet access environment, there often exists abusive and unfair usage of network resources. In this paper, the Internet access by the dormitory...
Tsung-Ching Lin, Yeali S. Sun, Shi-Chung Chang, Sh...
JCO
1998
69views more  JCO 1998»
15 years 6 months ago
Sortabilities of Partition Properties
Consider the partition of a set of integers into parts. Various partition properties have been proposed in the literature to facilitate the restriction of the focus of attention to...
Gerard J. Chang, Fu-Loong Chen, Lingling Huang, Fr...
DM
1999
101views more  DM 1999»
15 years 6 months ago
Characterizations of bipartite Steinhaus graphs
We characterize bipartite Steinhaus graphs in three ways by partitioning them into four classes and we describe the color sets for each of these classes. An interesting recursion ...
Gerard J. Chang, Bhaskar DasGupta, Wayne M. Dym&ag...