2083 search results - page 13 / 417 » Perception and Experience in Problem Solving |
126
click to vote
FLAIRS
2006
15 years 4 months ago
2006
There exist a number of algorithms that can solve dynamic constraint satisfaction/optimization problems (DynCSPs or DynCOPs). Because of the large variety in the characteristics o...
137
click to vote
IPPS
2007
IEEE
15 years 9 months ago
2007
IEEE
Solving optimally large instances of combinatorial optimization problems requires a huge amount of computational resources. In this paper, we propose an adaptation of the parallel...
121
click to vote
CCE
2004
15 years 2 months ago
2004
This contribution deals with scheduling problems of flexible chemical batch processes with a special emphasis on their real-time character. This implies not only the need for suff...
134
click to vote
KES
2010
Springer
15 years 1 months ago
2010
Springer
This paper proposes a new solution to the vehicle routing problem with time windows using an evolution strategy adopting viral infection. The problem belongs to the NP-hard class a...
158
click to vote
CONSTRAINTS
2010
15 years 13 days ago
2010
The subgraph isomorphism problem consists in deciding if there exists a copy of a pattern graph in a target graph. We introduce in this paper a global constraint and an associated ...