Sciweavers

1589 search results - page 240 / 318
» Constraints with Variables' Annotations
Sort
View
MOC
2000
131views more  MOC 2000»
13 years 9 months ago
Convergence of gauge method for incompressible flow
A new formulation, a gauge formulation of the incompressible Navier-Stokes equations in terms of an auxiliary field a and a gauge variable , u = a + , was proposed recently by E an...
Cheng Wang, Jian-Guo Liu
AI
1999
Springer
13 years 9 months ago
Bucket Elimination: A Unifying Framework for Reasoning
Bucket elimination is an algorithmic framework that generalizes dynamic programming to accommodate many problem-solving and reasoning tasks. Algorithms such as directional-resolut...
Rina Dechter
JCSS
2002
114views more  JCSS 2002»
13 years 9 months ago
Polymorphic Type Inference for the Relational Algebra
A database programming language is a programming language extended with database operations. In this paper we extend a core functional language with explicitly labeled tuples and ...
Jan Van den Bussche, Emmanuel Waller
INFOCOM
2010
IEEE
13 years 8 months ago
Value-aware Resource Allocation for Service Guarantees in Networks
—The traditional formulation of the total value of information transfer is a multi-commodity flow problem. Here, each data source is seen as generating a commodity along a fixe...
Parimal Parag, Srinivas Shakkottai, Jean-Fran&cced...
PSD
2010
Springer
109views Database» more  PSD 2010»
13 years 8 months ago
A Tool for Analyzing and Fixing Infeasible RCTA Instances
Minimum-distance controlled tabular adjustment methods (CTA), and its restricted variants (RCTA), is a recent perturbative approach for tabular data protection. Given a table to be...
Jordi Castro, José A. González