Sciweavers

2905 search results - page 259 / 581
» Formal Memetic Algorithms
Sort
View
SAC
2002
ACM
14 years 10 months ago
Soft constraint propagation and solving in CHRs
Soft constraints are a generalization of classical constraints, where constraints and/or partial assignments are associated to preference or importance levels, and constraints are...
Stefano Bistarelli, Thom W. Frühwirth, Michae...
ICRA
2010
IEEE
130views Robotics» more  ICRA 2010»
14 years 9 months ago
On the complexity of optimal reconfiguration planning for modular reconfigurable robots
— 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...
Feili Hou, Wei-Min Shen
TCS
2010
14 years 9 months ago
Computing the graph-based parallel complexity of gene assembly
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...
Artiom Alhazov, Chang Li, Ion Petre
TVCG
2010
174views more  TVCG 2010»
14 years 9 months ago
Subdivision Analysis of the Trilinear Interpolant
— Isosurfaces are fundamental volumetric visualization tools, and are generated by the well-known Marching Cubes cases that approximate contours of trilinearly-interpolated scala...
Hamish Carr, Nelson Max
CIKM
2010
Springer
14 years 9 months ago
Anonymizing data with quasi-sensitive attribute values
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 ...
Pu Shi, Li Xiong, Benjamin C. M. Fung