5580 search results - page 614 / 1116 » Randomized priority algorithms |
151
Voted
CANDC
2005
ACM
15 years 6 months ago
2005
ACM
The story of some early computer art drawings in 1965 is told. It is a story of randomness. Computer art is viewed here as the programming of classes of aesthetic objects. In the ...
165
click to vote
COCO
2008
Springer
15 years 6 months ago
2008
Springer
We study the complexity of deciding whether a given homogeneous multivariate polynomial has a nontrivial root over a finite field. Given a homogeneous algebraic circuit C that com...
141
Voted
ESTIMEDIA
2008
Springer
15 years 6 months ago
2008
Springer
Markov random field models provide a robust formulation of low-level vision problems. Among the problems, stereo vision remains the most investigated field. The belief propagation...
114
click to vote
AAAI
2006
15 years 6 months ago
2006
Many planning and design problems can be characterized as optimal search over a constrained network of conditional choices with preferences. To draw upon the advanced methods of c...
209
click to vote
IJCAI
2003
15 years 6 months ago
2003
Maximum satisfiability (Max-SAT) is more general and more difficult to solve than satisfiability (SAT). In this paper, we first investigate the effectiveness of Walksat, one of th...