Sciweavers

960 search results - page 102 / 192
» Optimal Monte Carlo Algorithms
Sort
View
AI
2003
Springer
14 years 3 months ago
An Improved Ant Colony Optimisation Algorithm for the 2D HP Protein Folding Problem
The prediction of a protein’s structure from its amino-acid sequence is one of the most important problems in computational biology. In the current focus on a widely studied abst...
Alena Shmygelska, Holger H. Hoos
JUCS
2006
101views more  JUCS 2006»
13 years 10 months ago
DS/CDMA Multiuser Detection with Evolutionary Algorithms
This work analyses two heuristic algorithms based on the genetic evolution theory applied to direct sequence code division multiple access (DS/CDMA) communication systems. For diff...
Fernando Ciriaco, Taufik Abrão, Paul Jean E...
FASE
2006
Springer
14 years 1 months ago
Formal Simulation and Analysis of the CASH Scheduling Algorithm in Real-Time Maude
This paper describes the application of the Real-Time Maude tool to the formal specification and analysis of the CASH scheduling algorithm and its suggested modifications. The CASH...
Peter Csaba Ölveczky, Marco Caccamo
WEA
2004
Springer
85views Algorithms» more  WEA 2004»
14 years 3 months ago
Faster Deterministic and Randomized Algorithms on the Homogeneous Set Sandwich Problem
A homogeneous set is a non-trivial, proper subset of a graph’s vertices such that all its elements present exactly the same outer neighborhood. Given two graphs, G1(V, E1), G2(V,...
Celina M. Herrera de Figueiredo, Guilherme Dias da...
ICML
1994
IEEE
14 years 1 months ago
Prototype and Feature Selection by Sampling and Random Mutation Hill Climbing Algorithms
With the goal of reducing computational costs without sacrificing accuracy, we describe two algorithms to find sets of prototypes for nearest neighbor classification. Here, the te...
David B. Skalak