Sciweavers

1972 search results - page 254 / 395
» connection 2008
Sort
View
JCO
2008
85views more  JCO 2008»
15 years 6 months ago
Locating and detecting arrays for interaction faults
The identification of interaction faults in component-based systems has focussed on indicating the presence of faults, rather than their location and magnitude. While this is a va...
Charles J. Colbourn, Daniel W. McClary
JCP
2008
121views more  JCP 2008»
15 years 6 months ago
Fuzzy Logic Bandwidth Prediction and Policing in a DiffServ-Aware Network
Differentiated Services (DiffServ)-aware network potentially can provide the next generation platform for multimedia support in the Internet. In this work we look at improving band...
Norashidah Md Din, Norsheila Fisal
JCP
2008
121views more  JCP 2008»
15 years 6 months ago
Relation Organization of SOM Initial Map by Improved Node Exchange
The Self Organizing Map (SOM) involves neural networks, that learns the features of input data thorough unsupervised, competitive neighborhood learning. In the SOM learning algorit...
Tsutomu Miyoshi
JDA
2008
94views more  JDA 2008»
15 years 6 months ago
Approximability of partitioning graphs with supply and demand
Suppose that each vertex of a graph G is either a supply vertex or a demand vertex and is assigned a positive real number, called the supply or the demand. Each demand vertex can ...
Takehiro Ito, Erik D. Demaine, Xiao Zhou, Takao Ni...
JGAA
2008
100views more  JGAA 2008»
15 years 6 months ago
Parameters of Bar k-Visibility Graphs
Bar k-visibility graphs are graphs admitting a representation in which the vertices correspond to horizontal line segments, called bars, and the edges correspond to vertical lines...
Stefan Felsner, Mareike Massow