526 search results - page 23 / 106 » Generalized benchmark generation for dynamic combinatorial p... |
GECCO
2007
Springer
15 years 3 months ago
2007
Springer
The Cross Entropy algorithm is a new search method for combinatorial problem. However, it needs considerable computational time to achieve good solution quality. To make the Cross...
69
Voted
DAGSTUHL
2007
14 years 11 months ago
2007
Automated political districting shares with electronic voting the aim of preventing electoral manipulation and pursuing an impartial electoral mechanism. Political districting can...
97
Voted
ICTAI
2005
IEEE
15 years 3 months ago
2005
IEEE
In this paper, we study strategies in incremental planning for ordering and grouping subproblems partitioned by the subgoals of a planning problem when each subproblem is solved b...
171
click to vote
CVPR
2012
IEEE
13 years 2 days ago
2012
IEEE
A large number of problems in computer vision can be modeled as energy minimization problems in a markov random field (MRF) framework. Many methods have been developed over the y...
FM
2005
Springer
15 years 3 months ago
2005
Springer
This paper presents an automated and compositional procedure to solve the substitutability problem in the context of evolving software systems. Our solution contributes two techniq...