11740 search results - page 196 / 2348 » More Problems in Rewriting |
123
click to vote
AAAI
2008
15 years 6 months ago
2008
This paper addresses the problem of plan recognition for multi-agent teams. Complex multi-agent tasks typically require dynamic teams where the team membership changes over time. ...
127
click to vote
APPROX
2008
Springer
15 years 6 months ago
2008
Springer
A long-standing conjecture in Combinatorial Optimization is that the integrality gap of the Held-Karp LP relaxation for the Asymmetric Traveling Salesman Problem (ATSP) is a consta...
118
click to vote
ESWS
2008
Springer
15 years 6 months ago
2008
Springer
Many tasks on the semantic web require the user to choose concepts from a limited vocabulary e.g. for describing an indexed resource or for use in semantic search. Semantic autocom...
104
click to vote
IJCAI
2007
15 years 6 months ago
2007
A key issue in artificial intelligence lies in finding the amount of input detail needed to do successful learning. Too much detail causes overhead and makes learning prone to ove...
118
click to vote
AIPS
2006
15 years 5 months ago
2006
Searches that include both feasible and infeasible solutions have proved to be efficient algorithms for solving some scheduling problems. Researchers conjecture that these algorit...