4903 search results - page 78 / 981 » The Set Covering Machine |
COCOON
2003
Springer
14 years 2 months ago
2003
Springer
We design efficient competitive algorithms for discovering hidden information using few queries. Specifically, consider a game in a given set of intervals (and their implied inte...
AAAI
2008
13 years 11 months ago
2008
A recurring theme in AI and multiagent systems is how to select the "most desirable" elements given a binary dominance relation on a set of alternatives. Schwartz's...
MOZ
2004
Springer
14 years 2 months ago
2004
Springer
1) the Warren’s Abstract Machine and (2) constraints on finite set.
HPCC
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. Service discovery is a crucial feature for the usability of mobile ad-hoc networks (MANETs). In this paper, Minimum Dominating Forward Node Set based Service Discovery Pr...
LREC
2010
13 years 10 months ago
2010
As the data for more and more languages is finding its way into digital form, with an increasing amount of this data being posted to the Web, it has become possible to collect lan...