3946 search results - page 357 / 790 » The computational complexity of choice sets |
226
click to vote
MOBIHOC
2004
ACM
16 years 9 days ago
2004
ACM
In third generation (3G) wireless data networks, repeated requests for popular data items can exacerbate the already scarce wireless spectrum. In this paper we propose an architec...
201
Voted
LICS
1991
IEEE
15 years 10 months ago
1991
IEEE
When logic programming is based on the proof theory of intuitionistic logic, it is natural to allow implications in goals and in the bodies of clauses. Attempting to prove a goal ...
226
Voted
ATAL
2010
Springer
15 years 8 months ago
2010
Springer
Recursive reasoning of the form what do I think that you think that I think (and so on) arises often while acting rationally in multiagent settings. Several multiagent decision-ma...
236
Voted
LOGCOM
1998
15 years 6 months ago
1998
Planning algorithms have traditionally been geared toward achievement goals in single-agent environments. Such algorithms essentially produce plans to reach one of a specified se...
206
Voted
KDD
2012
ACM
13 years 9 months ago
2012
ACM
Three major factors govern the intricacies of community extraction in networks: (1) the application domain includes a wide variety of networks of fundamentally different natures,...