Sciweavers

2996 search results - page 483 / 600
» Numberings and Randomness
Sort
View
JCC
2008
166views more  JCC 2008»
15 years 6 months ago
Reference energy extremal optimization: A stochastic search algorithm applied to computational protein design
: We adapt a combinatorial optimization algorithm, extremal optimization (EO), for the search problem in computational protein design. This algorithm takes advantage of the knowled...
Naigong Zhang, Chen Zeng
CORR
2007
Springer
98views Education» more  CORR 2007»
15 years 6 months ago
The Three-Color and Two-Color Tantrix(TM) Rotation Puzzle Problems are NP-Complete via Parsimonious Reductions
Abstract. Holzer and Holzer [7] proved that the TantrixTM rotation puzzle problem with four colors is NP-complete, and they showed that the infinite variant of this problem is und...
Dorothea Baumeister, Jörg Rothe
JIFS
2008
155views more  JIFS 2008»
15 years 6 months ago
Improving supervised learning performance by using fuzzy clustering method to select training data
The crucial issue in many classification applications is how to achieve the best possible classifier with a limited number of labeled data for training. Training data selection is ...
Donghai Guan, Weiwei Yuan, Young-Koo Lee, Andrey G...
JNW
2008
99views more  JNW 2008»
15 years 6 months ago
Probabilistic Key Management Practical Concerns in Wireless Sensor Networks
The subject of Key Management in Wireless Sensor Networks has gained increased attention from the security community around the world in the last years. Several proposals were made...
Rui Miguel Soares Silva, Nuno Sidónio A. Pe...
JPDC
2008
129views more  JPDC 2008»
15 years 6 months ago
A framework for scalable greedy coloring on distributed-memory parallel computers
We present a scalable framework for parallelizing greedy graph coloring algorithms on distributed-memory computers. The framework unifies several existing algorithms and blends a ...
Doruk Bozdag, Assefaw Hadish Gebremedhin, Fredrik ...