2354 search results - page 290 / 471 » Assignment Problems |
183
click to vote
ANOR
2006
15 years 6 months ago
2006
In this paper we introduce a new formulation of the logistics network design problem encountered in deterministic, single-country, single-period contexts. Our formulation is flexi...
148
Voted
ICCV
2005
IEEE
16 years 8 months ago
2005
IEEE
A wide range of low level vision problems have been formulated in terms of finding the most probable assignment of a Markov Random Field (or equivalently the lowest energy configu...
155
click to vote
EICS
2009
ACM
16 years 27 days ago
2009
ACM
This paper reports a usability evaluation of three operational digital libraries (DLs): the ACM DL, the IEEE Computer Society DL, and the IEEE Xplore DL. An experiment was conduct...
163
click to vote
SAT
2005
Springer
15 years 12 months ago
2005
Springer
We introduce two incomplete polynomial time algorithms to solve satisfiability problems which both use Linear Programming (LP) techniques. First, the FlipFlop LP attempts to simul...
174
click to vote
GECCO
2000
Springer
15 years 10 months ago
2000
Springer
This paper explores the application of multiobjective Genetic Algorithms (mGAs) to rural land use planning, a spatial allocation problem. Two mGAs are proposed. Both share an unde...