Sciweavers

106 search results - page 3 / 22
» Characterizing Minimal Interval Completions
Sort
View
SIAMMAX
2010
116views more  SIAMMAX 2010»
13 years 2 months ago
Acquired Clustering Properties and Solution of Certain Saddle Point Systems
Many mathematical models involve flow equations characterized by nonconstant viscosity, and a Stokes type problem with variable viscosity coefficient arises. Appropriate block diag...
M. A. Olshanskii, V. Simoncini
EUSFLAT
2003
146views Fuzzy Logic» more  EUSFLAT 2003»
13 years 9 months ago
Cut equivalence of fuzzy relations
Fuzzy relations on the same domain are classified according to the equality of families of cut sets. This equality of fuzzy relations is completely characterized, not only for un...
Branimir Seselja, Andreja Tepavcevic
TCS
2011
13 years 2 months ago
Minimal non-convex words
Using a combinatorial characterization of digital convexity based on words, one defines the language of convex words. The complement of this language forms an ideal whose minimal...
Xavier Provençal
SWAT
2004
Springer
125views Algorithms» more  SWAT 2004»
14 years 26 days ago
The Optimal Online Algorithms for Minimizing Maximum Lateness
It is well known that the Earliest-Deadline-First (EDF) and the Least-Laxity-First (LLF) algorithms are optimal algorithms for the problem of preemptively scheduling jobs that arr...
Patchrawat Uthaisombut
AISC
2004
Springer
14 years 28 days ago
Proof Search in Minimal Logic
ion Within Partial Deduction for Linear Logic . . . . . . . . . . . . . . . . . 52 P. K¨ungas A Decision Procedure for Equality Logic with Uninterpreted Functions . . . 66 O. Tver...
Helmut Schwichtenberg