14518 search results - page 332 / 2904 » Two Problems for Sophistication |
201
click to vote
SAC
2003
ACM
15 years 12 months ago
2003
ACM
Given a connected, weighted, undirected graph G and a bound D, the bounded-diameter minimum spanning tree problem seeks a spanning tree on G of lowest weight in which no path betw...
181
click to vote
FUN
2010
Springer
15 years 11 months ago
2010
Springer
In the classic Josephus problem, elements 1, 2, . . . , n are placed in order around a circle and a skip value k is chosen. The problem proceeds in n rounds, where each round consi...
170
click to vote
SC
1995
ACM
15 years 10 months ago
1995
ACM
The problem of determining the evolutionary history of species in the form of phylogenetic trees is known as the phylogeny problem. We present a parallelization of the character c...
199
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
This paper investigates how the Univariate Marginal Distribution Algorithm (UMDA) behaves in non-stationary environments when engaging in sampling and selection strategies designe...
203
click to vote
AI
2008
Springer
15 years 6 months ago
2008
Springer
We make a number of contributions to the study of the Quantified Constraint Satisfaction Problem (QCSP). The QCSP is an extension of the constraint satisfaction problem that can b...