2095 search results - page 408 / 419 » Improved pebbling bounds |
128
click to vote
AAAI
2008
15 years 27 days ago
2008
In this poster we describe the tabling techniques for Sequential and Concurrent Horn Transaction Logic. Horn Transaction Logic is an extension of classical logic programming with ...
103
click to vote
AIPS
2009
15 years 27 days ago
2009
Recent research in robot exploration and mapping has focused on sampling environmental hotspot fields. This exploration task is formalized by Low, Dolan, and Khosla (2008) in a se...
108
click to vote
CONEXT
2009
ACM
15 years 26 days ago
2009
ACM
In enterprise and data center networks, the scalability of the data plane becomes increasingly challenging as forwarding tables and link speeds grow. Simply building switches with...
101
click to vote
FOCS
2008
IEEE
15 years 25 days ago
2008
IEEE
Given a universe U of n elements and a weighted collection S of m subsets of U, the universal set cover problem is to a-priori map each element u ∈ U to a set S(u) ∈ S contain...
SIGIR
2010
ACM
14 years 12 months ago
2010
ACM
By analogy with merging documents rankings, the outputs from multiple search results clustering algorithms can be combined into a single output. In this paper we study the feasibi...