450 search results - page 73 / 90 » Satisfiability with Exponential Families |
164
click to vote
CP
2007
Springer
16 years 5 days ago
2007
Springer
Searching for optimal solutions to a problem using lower bounds obtained from a relaxation is a common idea in Heuristic Search and Planning. In SAT and CSPs, however, explicit rel...
161
click to vote
SACMAT
2009
ACM
16 years 15 days ago
2009
ACM
We develop the foundations for a theory of Group-Centric Secure Information Sharing (g-SIS), characterize a specific family of models in this arena and identify several direction...
179
click to vote
ISAAC
2004
Springer
15 years 11 months ago
2004
Springer
For c ∈ R, a c-spanner is a subgraph of a complete Euclidean graph satisfying that between any two vertices there exists a path of weighted length at most c times their geometric...
133
click to vote
SMA
1999
ACM
15 years 10 months ago
1999
ACM
Many solid modeling construction techniques produce non-manifold r-sets (solids). With each non-manifold model N we can associate a family of manifold solid models that are infini...
219
click to vote
OOPSLA
1995
Springer
15 years 9 months ago
1995
Springer
All object-oriented languages provide support for subtype polymorphism, which allows the writing of generic code that works for families of related types. There is also a need, ho...