242 search results - page 48 / 49 » Provably Bounded Optimal Agents |
AAAI
2006
14 years 11 months ago
2006
Description Logics (DLs) are the formal foundations of the standard web ontology languages OWL-DL and OWL-Lite. In the Semantic Web and other domains, ontologies are increasingly ...
64
Voted
AAAI
2000
14 years 11 months ago
2000
One challenge for research in constraint-based scheduling has been to produce scalable solution procedures under fairly general representational assumptions. Quite often, the comp...
INFOCOM
2010
IEEE
14 years 8 months ago
2010
IEEE
—In many scenarios network design is not enforced by a central authority, but arises from the interactions of several self-interested agents. This is the case of the Internet, wh...
113
click to vote
CN
2011
14 years 4 months ago
2011
In many scenarios network design is not enforced by a central authority, but arises from the interactions of several self-interested agents. This is the case of the Internet, wher...
110
click to vote
ATAL
2011
Springer
13 years 9 months ago
2011
Springer
The fastest known algorithm for solving General Bayesian Stackelberg games with a finite set of follower (adversary) types have seen direct practical use at the LAX airport for o...