Sciweavers

1242 search results - page 97 / 249
» The Theory of Grammar Constraints
Sort
View
CORR
2007
Springer
104views Education» more  CORR 2007»
15 years 6 months ago
Separable convex optimization problems with linear ascending constraints
Separable convex optimization problems with linear ascending inequality and equality constraints are addressed in this paper. An algorithm that explicitly characterizes the optimum...
Arun Padakandla, Rajesh Sundaresan
ICDE
1997
IEEE
92views Database» more  ICDE 1997»
16 years 7 months ago
Distributing Semantic Constraints Between Heterogeneous Databases
In recent years, research about distributing databases over networks has become increasingly important. Here we concentrate on the issues of interoperability of heterogeneous DBMS...
Stefan Grufman, Fredrik Samson, Suzanne M. Embury,...
VMCAI
2009
Springer
16 years 1 months ago
Synthesizing Switching Logic Using Constraint Solving
A new approach based on constraint solving techniques was recently proposed for verification of hybrid systems. This approach works by searching for inductive invariants of a give...
Ankur Taly, Sumit Gulwani, Ashish Tiwari
DOCENG
2009
ACM
16 years 24 days ago
On the analysis of queries with counting constraints
We study the analysis problem of XPath expressions with counting constraints. Such expressions are commonly used in document transformations or programs in which they select porti...
Everardo Bárcenas, Pierre Genevès, N...
SMA
2005
ACM
109views Solid Modeling» more  SMA 2005»
15 years 12 months ago
Numerical decomposition of geometric constraints
Geometric constraint solving is a key issue in CAD/CAM. Since Owen’s seminal paper, solvers typically use graph based decomposition methods. However, these methods become diffi...
Sebti Foufou, Dominique Michelucci, Jean-Paul Jurz...