Sciweavers

450 search results - page 73 / 90
» Satisfiability with Exponential Families
Sort
View
CP
2007
Springer
15 years 3 months ago
Structural Relaxations by Variable Renaming and Their Compilation for Solving MinCostSAT
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...
Miquel Ramírez, Hector Geffner
SACMAT
2009
ACM
15 years 4 months ago
Foundations for group-centric secure information sharing models
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...
Ram Krishnan, Ravi S. Sandhu, Jianwei Niu, William...
ISAAC
2004
Springer
170views Algorithms» more  ISAAC 2004»
15 years 2 months ago
Spanners, Weak Spanners, and Power Spanners for Wireless Networks
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...
Christian Schindelhauer, Klaus Volbert, Martin Zie...
SMA
1999
ACM
100views Solid Modeling» more  SMA 1999»
15 years 1 months ago
Matchmaker: manifold BReps for non-manifold r-sets
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...
Jarek Rossignac, David E. Cardoze
133
Voted
OOPSLA
1995
Springer
15 years 1 months ago
Subtypes vs. Where Clauses: Constraining Parametric Polymorphism
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...
Mark Day, Robert Gruber, Barbara Liskov, Andrew C....