1816 search results - page 322 / 364 » A New Approach for Solving the Maximum Clique Problem |
167
click to vote
CVPR
2010
IEEE
15 years 9 months ago
2010
IEEE
For various 3D shape analysis tasks, the LaplaceBeltrami(LB) embedding has become increasingly popular as it enables the efficient comparison of shapes based on intrinsic geometry...
181
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
Multiagent environments are often highly dynamic and only partially observable which makes deliberative action planning computationally hard. In many such environments, however, a...
212
click to vote
EWCBR
2008
Springer
15 years 7 months ago
2008
Springer
Abstract. Case-based planning (CBP) is based on reusing past successful plans for solving new problems. CBP is particularly useful in environments where the large amount of time re...
155
click to vote
ATMOS
2007
15 years 7 months ago
2007
We discuss timetables in ex-urban bus traffic that consist of many trips serviced every day together with some exceptions that do not repeat daily. Traditional optimization methods...
155
click to vote
IJCAI
2003
15 years 7 months ago
2003
An agent with limited consumable execution resources needs policies that attempt to achieve good performance while respecting these limitations. Otherwise, an agent (such as a pla...