Sciweavers

1332 search results - page 130 / 267
» Combinatorial Algorithms
Sort
View
IJCAI
1997
13 years 10 months ago
Mini-Buckets: A General Scheme for Generating Approximations in Automated Reasoning
The class of algorithms for approximating reasoning tasks presented in this paper is based on approximating the general bucket elimination framework. The algorithms have adjustabl...
Rina Dechter
JSC
2000
99views more  JSC 2000»
13 years 9 months ago
Computing Orbits of Minimal Parabolic k-subgroups Acting on Symmetric k-varieties
The orbits of a minimal parabolic k-subgroup acting on a symmetric k-variety are essential to the study of symmetric k-varieties and their representations. This paper gives an algo...
Aloysius G. Helminck
ICCS
2003
Springer
14 years 2 months ago
A New Approach to Survivability of Connection Oriented Networks
Issues of network reliability are very important in modern computer networks. Even a short failure of a network link can cause substantial consequences. In this paper we concentrat...
Krzysztof Walkowiak
COMPGEOM
2005
ACM
13 years 11 months ago
Stability of persistence diagrams
The persistence diagram of a real-valued function on a topological space is a multiset of points in the extended plane. We prove that under mild assumptions on the function, the p...
David Cohen-Steiner, Herbert Edelsbrunner, John Ha...
CORR
2008
Springer
118views Education» more  CORR 2008»
13 years 9 months ago
A Logic Programming Framework for Combinational Circuit Synthesis
Abstract. Logic Programming languages and combinational circuit synthesis tools share a common "combinatorial search over logic formulae" background. This paper attempts ...
Paul Tarau, Brenda Luderman