4430 search results - page 697 / 886 » Solving Optimization Problems with DLL |
166
click to vote
EVOW
2007
Springer
16 years 22 days ago
2007
Springer
Many instances of NP-hard problems can be solved efficiently if the treewidth of their corresponding graph is small. Finding the optimal tree decompositions is an NP-hard problem a...
148
click to vote
GECCO
2007
Springer
16 years 22 days ago
2007
Springer
The artificial immune system approach for self-nonself discrimination and its application to anomaly detection problems in engineering is showing great promise. A seminal contribu...
163
click to vote
UIST
2006
ACM
16 years 15 days ago
2006
ACM
NP-hard combinatorial optimization problems are common in real life. Due to their intractability, local search algorithms are often used to solve such problems. Since these algori...
181
click to vote
ICRA
2005
IEEE
16 years 5 days ago
2005
IEEE
— In the real world, noisy sensors and limited communication make it difficult for robot teams to coordinate in tightly coupled tasks. Team members cannot simply apply single-ro...
161
click to vote
ICTAI
2005
IEEE
16 years 5 days ago
2005
IEEE
Partially Observable Markov Decision Processes (POMDPs) provide a general framework for AI planning, but they lack the structure for representing real world planning problems in a...