747 search results - page 103 / 150 » Theory and Construction of Molecular Computers |
150
click to vote
GECCO
2005
Springer
15 years 11 months ago
2005
Springer
A quality-time analysis of multi-objective evolutionary algorithms (MOEAs) based on schema theorem and building blocks hypothesis is developed. A bicriteria OneMax problem, a hypo...
162
click to vote
COMPGEOM
2009
ACM
15 years 10 months ago
2009
ACM
The k-means algorithm is a well-known method for partitioning n points that lie in the d-dimensional space into k clusters. Its main features are simplicity and speed in practice....
181
click to vote
EMSOFT
2006
Springer
15 years 9 months ago
2006
Springer
Concurrent programming languages should be a good fit for embedded systems because they match the intrinsic parallelism of their architectures and environments. Unfortunately, typ...
146
click to vote
DCG
2008
15 years 6 months ago
2008
In this paper we study connections between planar graphs, Schnyder woods, and orthogonal surfaces. Schnyder woods and the face counting approach have important applications in gra...
192
click to vote
HEURISTICS
2006
15 years 6 months ago
2006
Representing and reasoning with an agent's preferences is important in many applications of constraints formalisms. Such preferences are often only partially ordered. One clas...