Sciweavers

2899 search results - page 357 / 580
» On the Complexity of Exclusion Algorithms for Optimization
Sort
View
JAPLL
2010
179views more  JAPLL 2010»
15 years 5 months ago
Tractable query answering and rewriting under description logic constraints
Answering queries over an incomplete database w.r.t. a set of constraints is an important computational task with applications in fields as diverse as information integration and ...
Héctor Pérez-Urbina, Boris Motik, Ia...
IJCAI
1997
15 years 7 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
PODS
2009
ACM
119views Database» more  PODS 2009»
16 years 7 months ago
Exceeding expectations and clustering uncertain data
Database technology is playing an increasingly important role in understanding and solving large-scale and complex scientific and societal problems and phenomena, for instance, un...
Sudipto Guha, Kamesh Munagala
NETCOOP
2007
Springer
16 years 19 days ago
How Expensive Is Link Utilization?
Understanding the relationship between queueing delays and link utilization for general traffic conditions is an important open problem in networking research. Difficulties in unde...
Rade Stanojevic, Robert Shorten
COMCOM
2010
95views more  COMCOM 2010»
15 years 5 months ago
Trading link utilization for queueing delays: An adaptive approach
Understanding the relationship between queueing delays and link utilization for general traffic conditions is an important open problem in networking research. Difficulties in und...
Rade Stanojevic, Robert Shorten