4377 search results - page 321 / 876 » Mass problems and randomness |
175
click to vote
CEC
2007
IEEE
16 years 1 months ago
2007
IEEE
—Constraint satisfaction problems (CSPs) widely occur in artificial intelligence. In the last twenty years, many algorithms and heuristics were developed to solve CSP. Recently,...
140
click to vote
ISICA
2007
Springer
16 years 27 days ago
2007
Springer
Abstract. MOEA/D is a novel and successful Multi-Objective Evolutionary Algorithms(MOEA) which utilizes the idea of problem decomposition to tackle the complexity from multiple obj...
151
click to vote
ICCBR
2003
Springer
15 years 12 months ago
2003
Springer
In [1] we propose interchangeability based algorithms as methods for solving the case adaptation for the domain of problems which can be expressed as Constraint Satisfaction Proble...
181
click to vote
FOCS
2000
IEEE
15 years 11 months ago
2000
IEEE
We show that the graph isomorphism problem is hard under DLOGTIME uniform AC0 many-one reductions for the complexity classes NL, PL (probabilistic logarithmic space) for every loga...
169
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
This paper presents an automatic design method for piping arrangement. A pipe arrangement design problem is proposed for a space in which many pipes and objects co-exist. This pro...