Sciweavers

95 search results - page 5 / 19
» Classification of Random Boolean Networks
Sort
View
FLAIRS
2008
14 years 3 days ago
Tractable Class of a Problem of Goal Satisfaction in Mutual Exclusion Network
In this paper we describe a class of a problem of goal satisfaction in mutual exclusion network that can be solved in polynomial time. This problem provides a common basis for rea...
Pavel Surynek
ADHOCNOW
2006
Springer
14 years 3 months ago
A Classification and Performance Comparison of Mobility Models for Ad Hoc Networks
In mobile ad hoc network research, simulation plays an important role in determining the network characteristics and measuring performance. On the other hand, unrealistic simulatio...
Emre Atsan, Öznur Özkasap
ICONIP
2008
13 years 11 months ago
A Notable Swarm Approach to Evolve Neural Network for Classification in Data Mining
This paper presents a novel and notable swarm approach to evolve an optimal set of weights and architecture of a neural network for classification in data mining. In a distributed ...
Satchidananda Dehuri, Bijan Bihari Misra, Sung-Bae...
BMCBI
2005
178views more  BMCBI 2005»
13 years 9 months ago
A quantization method based on threshold optimization for microarray short time series
Background: Reconstructing regulatory networks from gene expression profiles is a challenging problem of functional genomics. In microarray studies the number of samples is often ...
Barbara Di Camillo, Fatima Sanchez-Cabo, Gianna To...
CORR
2010
Springer
136views Education» more  CORR 2010»
13 years 7 months ago
Schaefer's theorem for graphs
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
Manuel Bodirsky, Michael Pinsker