9842 search results - page 385 / 1969 » The Complexity of the Matching-Cut Problem |
129
click to vote
AI
2006
Springer
15 years 8 months ago
2006
Springer
We are interested in contributing to solving effectively a particular type of real-time stochastic resource allocation problem. Firstly, one distinction is that certain tasks may c...
116
click to vote
GECCO
2006
Springer
15 years 8 months ago
2006
Springer
Particle Swarm Optimization (PSO) is a population-based optimization method in which search points employ a cooperative strategy to move toward one another. In this paper we show ...
149
click to vote
COGSCI
2010
15 years 4 months ago
2010
With only two to five slots of visual working memory (VWM), humans are able to quickly solve complex visual problems to near optimal solutions. To explain the paradox between tigh...
156
click to vote
CONSTRAINTS
2006
15 years 4 months ago
2006
Abstract. Constraint Programming (CP) offers a rich modeling language of constraints embedding efficient algorithms to handle complex and heterogeneous combinatorial problems. To s...
122
click to vote
MP
2008
15 years 4 months ago
2008
: We present polynomial-time interior-point algorithms for solving the Fisher and Arrow-Debreu competitive market equilibrium problems with linear utilities and n players. Both of ...