Sciweavers

4117 search results - page 291 / 824
» On the Satisfiability of Complex Constraints
Sort
View
DLOG
2010
15 years 4 months ago
Guiding Reification in OWL through Aggregation
We put forward a methodological approach aimed at guiding ontology modellers in choosing which relations to reify. Our proposal is based on the notion of aggregation as used in con...
Paula Severi, José Luiz Fiadeiro, David Eks...
CEC
2007
IEEE
15 years 10 months ago
A multi-layered solution for supporting isp traffic demand using genetic algorithm
This paper proposes a unique feedback governed multi layered architectural model to support ISP's traffic demands with multiple Quality of Service(QoS) constraints. The propos...
Gajaruban Kandavanam, Dmitri Botvich, Sasitharan B...
CORR
2006
Springer
107views Education» more  CORR 2006»
15 years 6 months ago
Dense Gaussian Sensor Networks: Minimum Achievable Distortion and the Order Optimality of Separation
We investigate the optimal performance of dense sensor networks by studying the joint source-channel coding problem. The overall goal of the sensor network is to take measurements...
Nan Liu, Sennur Ulukus
SEMWEB
2007
Springer
16 years 27 days ago
Sampling and Soundness: Can We Have Both?
Recent research on model counting in CNF formulas has shown that a certain sampling method can yield results that are sound with a provably high probability. The key idea is to ite...
Carla P. Gomes, Jörg Hoffmann, Ashish Sabharw...
AAAI
2006
15 years 8 months ago
Model Counting: A New Strategy for Obtaining Good Bounds
Model counting is the classical problem of computing the number of solutions of a given propositional formula. It vastly generalizes the NP-complete problem of propositional satis...
Carla P. Gomes, Ashish Sabharwal, Bart Selman