8647 search results - page 525 / 1730 » The Container Selection Problem |
199
click to vote
AAAI
2000
15 years 8 months ago
2000
This paper addresses the problem of tracking and diagnosing complex systems with mixtures of discrete and continuous variables. This problem is a difficult one, particularly when ...
165
click to vote
IJCAI
1993
15 years 8 months ago
1993
We introduce a new approach to GA (Genetic Algorithms) based problem solving. Earlier GAs did not contain local search (i.e. hill climbing) mechanisms, which led to optimization d...
183
click to vote
AI
2010
Springer
15 years 7 months ago
2010
Springer
The subgraph isomorphism problem involves deciding if there exists a copy of a pattern graph in a target graph. This problem may be solved by a complete tree search combined with ...
157
click to vote
ANOR
2008
15 years 7 months ago
2008
Abstract Given a collection of individual preferences defined on a same finite set of candidates, we consider the problem of aggregating them into a collective preference minimizin...
200
click to vote
ARSCOM
2004
15 years 6 months ago
2004
We show that several known theorems on graphs and digraphs are equivalent. The list of equivalent theorems include Kotzig's result on graphs with unique 1-factors, a lemma by...