1695 search results - page 240 / 339 » Linear, Polynomial or Exponential |
154
click to vote
ESA
2000
Springer
15 years 8 months ago
2000
Springer
The resource constrained shortest path problem (CSP) asks for the computation of a least cost path obeying a set of resource constraints. The problem is NP-complete. We give theore...
150
click to vote
POPL
2000
ACM
15 years 7 months ago
2000
ACM
Systems that authenticate a user based on a shared secret (such as a password or PIN) normally allow anyone to query whether the secret is a given value. For example, an ATM machi...
145
click to vote
WICON
2008
15 years 5 months ago
2008
It is well known that the maximum weighted independent set (MWIS) problem is NP-complete. Moreover, optimal scheduling in wireless networks requires solving a MWIS problem. Conseq...
141
click to vote
AIPS
2006
15 years 5 months ago
2006
We present a decision making algorithm for agents that act in partially observable domains which they do not know fully. Making intelligent choices in such domains is very difficu...
122
click to vote
IJCAI
2001
15 years 5 months ago
2001
Market mechanisms play a central role in AI as a coordination tool in multiagent systems and as an application area for algorithm design. Mechanisms where buyers are directly clea...