2526 search results - page 188 / 506 » A New Algorithm for Answer Set Computation |
183
click to vote
WG
2005
Springer
15 years 12 months ago
2005
Springer
Partitive set families are families of sets that can be quite large, but have a compact, recursive representation in the form of a tree. This tree is a common generalization of PQ...
205
click to vote
HICSS
2008
IEEE
15 years 6 months ago
2008
IEEE
Selecting a small set of nodes called pivots, from all the nodes in a network and maintaining the routing infrastructure to and among each other can reduce routing overhead and ex...
203
click to vote
FOCS
2006
IEEE
16 years 16 days ago
2006
IEEE
Combinatorial allocation problems require allocating items to players in a way that maximizes the total utility. Two such problems received attention recently, and were addressed ...
155
click to vote
FOCS
2008
IEEE
16 years 29 days ago
2008
IEEE
We consider the problem of online sublinear expander reconstruction and its relation to random walks in “noisy” expanders. Given access to an adjacency list representation of ...
165
click to vote
IMC
2003
ACM
15 years 11 months ago
2003
ACM
Internet coordinate schemes have been proposed as a method for estimating minimum round trip time between hosts without direct measurement. In such a scheme, each host is assigned...