Sciweavers

1578 search results - page 113 / 316
» Induction of Stable Models
Sort
View
DSN
2006
IEEE
14 years 4 months ago
One-step Consensus with Zero-Degradation
In the asynchronous distributed system model, consensus is obtained in one communication step if all processes propose the same value. Assuming f < n/3, this is regardless of t...
Dan Dobre, Neeraj Suri
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...