193 search results - page 13 / 39 » Partial Solutions with Unique Completion |
130
Voted
IWFM
1998
15 years 5 months ago
1998
We study strictly level-decreasing logic programs (sld-programs) as defined earlier by the present authors. It will be seen that sld-programs, unlike most other classes of logic p...
106
Voted
INFOCOM
2003
IEEE
15 years 9 months ago
2003
IEEE
— Knowledge of the up-to-date physical (i.e., layer-2) topology of an Ethernet network is crucial to a number of critical network management tasks, including reactive and proacti...
121
Voted
FOCS
2006
IEEE
15 years 9 months ago
2006
IEEE
In this paper we introduce a new general framework for set covering problems, based on the combination of randomized rounding of the (near-)optimal solution of the Linear Programm...
142
Voted
EJC
2008
15 years 2 months ago
2008
For a graph G and a set D V (G), define Nr[x] = {xi V (G) : d(x, xi) r} (where d(x, y) is graph theoretic distance) and Dr(x) = Nr[x] D. D is known as an r-identifying code if...
123
click to vote
CALCO
2007
Springer
15 years 10 months ago
2007
Springer
We discuss the treatment of initial datatypes and final process types in the wide-spectrum language HasCASL. In particular, we present specifications that illustrate how datatype...