88 search results - page 12 / 18 » Solving Non-Boolean Satisfiability Problems with Stochastic ... |
112
click to vote
ICDCS
2010
IEEE
15 years 3 months ago
2010
IEEE
—We propose a steepest descent method to compute optimal control parameters for balancing between multiple performance objectives in stateless stochastic scheduling, wherein the ...
119
click to vote
PRICAI
1998
Springer
15 years 3 months ago
1998
Springer
Many real-world constraint satisfaction problems (CSPs) can be over-constrained but contain a set of mandatory or hard constraints that have to be satisfied for a solution to be ac...
GECCO
2007
Springer
15 years 5 months ago
2007
Springer
A common problem in genetic programming search algorithms is destructive crossover in which the offspring of good parents generally has worse performance than the parents. Design...
111
click to vote
GECCO
2008
Springer
15 years 20 days ago
2008
Springer
The key ideas behind most of the recently proposed Markov networks based EDAs were to factorise the joint probability distribution in terms of the cliques in the undirected graph....
136
click to vote
CVPR
2008
IEEE
16 years 1 months ago
2008
IEEE
Given an object model and a black-box measure of similarity between the model and candidate targets, we consider visual object tracking as a numerical optimization problem. During...