Sciweavers

2086 search results - page 133 / 418
» Mathematical Theory Exploration
Sort
View
ISSAC
2001
Springer
123views Mathematics» more  ISSAC 2001»
15 years 8 months ago
A probabilistic algorithm to test local algebraic observability in polynomial time
The following questions are often encountered in system and control theory. Given an algebraic model of a physical process, which variables can be, in theory, deduced from the inp...
Alexandre Sedoglavic
134
Voted
ISSAC
1997
Springer
142views Mathematics» more  ISSAC 1997»
15 years 7 months ago
The Structure of Sparse Resultant Matrices
Resultants characterize the existence of roots of systems of multivariate nonlinear polynomial equations, while their matrices reduce the computation of all common zeros to a prob...
Ioannis Z. Emiris, Victor Y. Pan
127
Voted
GECCO
2006
Springer
157views Optimization» more  GECCO 2006»
15 years 7 months ago
How randomized search heuristics find maximum cliques in planar graphs
Surprisingly, general search heuristics often solve combinatorial problems quite sufficiently, although they do not outperform specialized algorithms. Here, the behavior of simple...
Tobias Storch
126
Voted
PODS
2010
ACM
197views Database» more  PODS 2010»
15 years 3 months ago
When data dependencies over SQL tables meet the logics of paradox and S-3
We study functional and multivalued dependencies over SQL tables with NOT NULL constraints. Under a no-information interpretation of null values we develop tools for reasoning. We...
Sven Hartmann, Sebastian Link
114
Voted
DEDS
2008
108views more  DEDS 2008»
15 years 3 months ago
An Algorithmic Toolbox for Network Calculus
Network calculus offers powerful tools to analyze the performances in communication networks, in particular to obtain deterministic bounds. This theory is based on a strong mathema...
Anne Bouillard, Eric Thierry