895 search results - page 120 / 179 » Using graphs for some discrete tomography problems |
108
click to vote
CEC
2011
IEEE
13 years 10 months ago
2011
IEEE
—Constrained Genetic Programming (CGP) is a method of searching the Genetic Programming search space non-uniformly, giving preferences to certain subspaces according to some heur...
CP
2005
Springer
15 years 3 months ago
2005
Springer
Constrained path problems have to do with finding paths in graphs subject to constraints. One way of constraining the graph is by enforcing reachability on nodes. For instance, i...
GMP
2008
IEEE
15 years 4 months ago
2008
IEEE
The paper deals with the problem of remeshing and fairing of undersampled areas (called ”holes”) in triangular meshes. In this work, we are particularly interested in meshes co...
124
click to vote
NDSS
2000
IEEE
15 years 2 months ago
2000
IEEE
Abstract. Chameleon signatures simultaneously provide the properties of nonrepudiation and non-transferability for the signed message. However, the initial constructions of chamele...
SIAMSC
2008
14 years 10 months ago
2008
In this paper we consider a finite element discretization of the Oldroyd-B model of viscoelastic flows. The method uses standard continuous polynomial finite element spaces for vel...