1263 search results - page 69 / 253 » A* with Bounded Costs |
FPL
2000
Springer
15 years 1 months ago
2000
Springer
Many applications can be modeled as subgraph isomorphism problems. However, this problem is generally NP-complete and difficult to compute. A custom computing circuit is a prospect...
TSMC
2002
14 years 9 months ago
2002
Abstract--A substantial effort has been devoted to various incentive Stackelberg solution concepts. Most of these concepts work well in the sense that the leader can get his desire...
SIGECOM
2009
ACM
15 years 4 months ago
2009
ACM
We study the relationship between the social cost of correlated equilibria and the social cost of Nash equilibria. In contrast to previous work focusing on the possible benefits ...
ALGORITHMICA
2010
14 years 10 months ago
2010
We investigate the convergence of the price of anarchy after a limited number of moves in the classical multicast communication game when the underlying communication networks is ...
CP
2005
Springer
15 years 3 months ago
2005
Springer
Besides search, complete inference methods can also be used to solve soft constraint problems. Their main drawback is the high spatial complexity. To improve its practical usage, w...