2905 search results - page 259 / 581 » Formal Memetic Algorithms |
143
Voted
SAC
2002
ACM
15 years 3 months ago
2002
ACM
Soft constraints are a generalization of classical constraints, where constraints and/or partial assignments are associated to preference or importance levels, and constraints are...
103
Voted
ICRA
2010
IEEE
15 years 2 months ago
2010
IEEE
— This paper presents a thorough analysis of the computational complexity of optimal reconfiguration planning problem for chain-type modular robots, i.e. finding the least number...
164
Voted
TCS
2010
15 years 2 months ago
2010
We consider a graph-theoretical formalization of the process of gene assembly in ciliates introduced in Ehrenfeucht et al (2003), where a gene is modeled as a signed graph. The ge...
94
Voted
TVCG
2010
15 years 2 months ago
2010
— Isosurfaces are fundamental volumetric visualization tools, and are generated by the well-known Marching Cubes cases that approximate contours of trilinearly-interpolated scala...
102
Voted
CIKM
2010
Springer
15 years 1 months ago
2010
Springer
We study the problem of anonymizing data with quasi-sensitive attributes. Quasi-sensitive attributes are not sensitive by themselves, but certain values or their combinations may ...