Sciweavers

174 search results - page 10 / 35
» Interval-valued soft constraint problems
Sort
View
ENTCS
2007
190views more  ENTCS 2007»
14 years 9 months ago
Modelling Multicast QoS Routing by using Best-Tree Search in And-or Graphs and Soft Constraint Logic Programming
We suggest a formal model to represent and solve the multicast routing problem in multicast networks. To attain this, we model the network adapting it to a weighted and-or graph, ...
Stefano Bistarelli, Ugo Montanari, Francesca Rossi...
IFIP
2004
Springer
15 years 2 months ago
Reasoning about Secure Interoperation Using Soft Constraints
Abstract The security of a network configuration is based not just on the security of its individual components and their direct interconnections, but also on the potential for sy...
Stefano Bistarelli, Simon N. Foley, Barry O'Sulliv...
ECCV
1996
Springer
15 years 11 months ago
Imposing Hard Constraints on Soft Snakes
An approach is presented for imposing generic hard constraints on deformable models at a low computational cost, while preserving the good convergence properties of snake-like mod...
Pascal Fua, Christian Brechbühler
TIT
2008
102views more  TIT 2008»
14 years 9 months ago
Extremal Problems of Information Combining
Abstract--In this paper, we study moments of soft bits of binary-input symmetric-output channels and solve some extremal problems of the moments. We use these results to solve the ...
Yibo Jiang, Alexei E. Ashikhmin, Ralf Koetter, And...
ECAI
2004
Springer
15 years 2 months ago
Guiding a Theorem Prover with Soft Constraints
Attempts to use finite models to guide the search for proofs by resolution and the like in first order logic all suffer from the need to trade off the expense of generating and m...
John K. Slaney, Arnold Binas, David Price