Sciweavers

2398 search results - page 46 / 480
» Constraint Programming and Graph Algorithms
Sort
View
PLDI
2004
ACM
14 years 4 months ago
Cost effective dynamic program slicing
Although dynamic program slicing was first introduced to aid in user level debugging, applications aimed at improving software quality, reliability, security, and performance hav...
Xiangyu Zhang, Rajiv Gupta
CP
2005
Springer
14 years 4 months ago
Automatic Detection of Variable and Value Symmetries
Abstract. Many symmetry breaking techniques assume that the symmetries of a CSP are given as input in addition to the CSP itself. We present a method that can be used to detect all...
Jean-Francois Puget
TON
2002
144views more  TON 2002»
13 years 10 months ago
Algorithms for provisioning virtual private networks in the hose model
Virtual Private Networks (VPNs) provide customers with predictable and secure network connections over a shared network. The recently proposed hose model for VPNs allows for great...
Amit Kumar, Rajeev Rastogi, Abraham Silberschatz, ...
JMLR
2010
149views more  JMLR 2010»
13 years 5 months ago
Learning Bayesian Network Structure using LP Relaxations
We propose to solve the combinatorial problem of finding the highest scoring Bayesian network structure from data. This structure learning problem can be viewed as an inference pr...
Tommi Jaakkola, David Sontag, Amir Globerson, Mari...
LCC
1994
213views Algorithms» more  LCC 1994»
14 years 2 months ago
Linear Constraint Query Languages: Expressive Power and Complexity
We give an AC0 upper bound on the complexity of rst-oder queries over (in nite) databases de ned by restricted linear constraints. This result enables us to deduce the non-expressi...
Stéphane Grumbach, Jianwen Su, Christophe T...