6575 search results - page 697 / 1315 » Specializing visualization algorithms |
192
click to vote
ECAI
2008
Springer
15 years 9 months ago
2008
Springer
Abstract. Some constraint problems have a combinatorial structure where the constraints allow the sequence of variables to be rotated (necklaces), if not also the domain values to ...
207
click to vote
EVOW
2008
Springer
15 years 9 months ago
2008
Springer
Adaptation to dynamic optimization problems is currently receiving a growing interest as one of the most important applications of evolutionary algorithms. In this paper, a compoun...
151
click to vote
CCCG
2008
15 years 8 months ago
2008
We introduce the problem of draining water (or balls representing water drops) out of a punctured polygon (or a polyhedron) by rotating the shape. For 2D polygons, we obtain combi...
187
click to vote
DAGSTUHL
2007
15 years 8 months ago
2007
We consider one-round games between a classical verifier and two provers who share entanglement. We show that when the constraints enforced by the verifier are ‘unique’ cons...
158
click to vote
EUSFLAT
2007
15 years 8 months ago
2007
In this paper we extend a previous definition of gradual dependence as a special kind of (crisp) association rule, in order to measure not only the existence of a tendency, but i...