4488 search results - page 18 / 898 » Focusing Search by Using Problem Solving Experience |
103
click to vote
ORL
2007
15 years 1 months ago
2007
A method that utilizes the polynomially solvable critical independent set problem for solving the maximum independent set problem on graphs with a nonempty critical independent se...
97
Voted
ICEC
1994
15 years 3 months ago
1994
Combinatorial optimization problems require computing efforts which grow at least exponentially with the problem dimension. Therefore, the use of the remarkable power of massively...
251
click to vote
GECCO
2011
Springer
14 years 5 months ago
2011
Springer
The generalized traveling salesman problem (GTSP) is an NPhard problem that extends the classical traveling salesman problem by partitioning the nodes into clusters and looking fo...
138
click to vote
GECCO
2007
Springer
15 years 8 months ago
2007
Springer
The Unit Commitment Problem (UCP) is the task of finding an optimal turn on and turn off schedule for a group of power generation units over a given time horizon to minimize ope...
109
click to vote
DIAGRAMS
2008
Springer
15 years 4 months ago
2008
Springer
State-space search methods in problem solving have often been illustrated using tree diagrams. We explore a set of issues related to coordination in collaborative problem solving a...