Sciweavers

632 search results - page 53 / 127
» constraints 2000
Sort
View
MOC
2000
131views more  MOC 2000»
13 years 7 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
PODS
2000
ACM
102views Database» more  PODS 2000»
14 years 1 days ago
Linear Approximation of Planar Spatial Databases Using Transitive-Closure Logic
We consider spatial databases in the plane that can be defined by polynomial constraint formulas. Motivated by applications in geographic information systems, we investigate line...
Floris Geerts, Bart Kuijpers
DSN
2000
IEEE
14 years 3 days ago
Resource Scheduling in Dependable Integrated Modular Avionics
In the recent development of avionics systems, Integrated Modular Avionics (IMA) is advocated for next generation architecture that needs integration of mixedcriticality real-time...
Yann-Hang Lee, Daeyoung Kim, Mohamed F. Younis, Je...
CP
2000
Springer
14 years 1 days ago
Boosting Search with Variable Elimination
Abstract. Variable elimination is the basic step of Adaptive Consistency 4 . It transforms the problem into an equivalent one, having one less variable. Unfortunately, there are ma...
Javier Larrosa
SODA
2000
ACM
114views Algorithms» more  SODA 2000»
13 years 9 months ago
Typical random 3-SAT formulae and the satisfiability threshold
: k-SAT is one of the best known among a wide class of random constraint satisfaction problems believed to exhibit a threshold phenomenon where the control parameter is the ratio, ...
Olivier Dubois, Yacine Boufkhad, Jacques Mandler