Sciweavers

1022 search results - page 59 / 205
» Stable models and circumscription
Sort
View
INFOCOM
2005
IEEE
14 years 3 months ago
Designing incentives for peer-to-peer routing
Abstract— In a peer-to-peer network, nodes are typically required to route packets for each other. This leads to a problem of “free-loaders,” nodes that use the network but r...
Alberto Blanc, Yi-Kai Liu, Amin Vahdat
EPIA
2005
Springer
14 years 3 months ago
Operational Semantics for DyLPs
Theoretical research has spent some years facing the problem of how to represent and provide semantics to updates of logic programs. This problem is relevant for addressing highly ...
Federico Banti, José Júlio Alferes, ...
LPNMR
2004
Springer
14 years 3 months ago
Set Constraints in Logic Programming
We investigate a generalization of weight-constraint programs with stable semantics, as implemented in the ASP solver smodels. Our programs admit atoms of the form X, F where X is ...
V. Wiktor Marek, Jeffrey B. Remmel
SCALESPACE
1999
Springer
14 years 2 months ago
Fast Geodesic Active Contours
—We use an unconditionally stable numerical scheme to implement a fast version of the geodesic active contour model. The proposed scheme is useful for object segmentation in imag...
Roman Goldenberg, Ron Kimmel, Ehud Rivlin, Michael...
SWAT
1992
Springer
116views Algorithms» more  SWAT 1992»
14 years 2 months ago
Sorting Multisets Stably in Minimum Space
Abstract. In a decision tree model, (n log2 n m i=1 ni log2 ni + n) is known to be a lower bound for sorting a multiset of size n containing m distinct elements, where the ith dist...
Jyrki Katajainen, Tomi Pasanen