Sciweavers

1071 search results - page 15 / 215
» Theories of Automatic Structures and Their Complexity
Sort
View
ISSAC
1997
Springer
142views Mathematics» more  ISSAC 1997»
14 years 4 days 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
CORR
2004
Springer
176views Education» more  CORR 2004»
13 years 7 months ago
The First-Order Theory of Sets with Cardinality Constraints is Decidable
Data structures often use an integer variable to keep track of the number of elements they store. An invariant of such data structure is that the value of the integer variable is ...
Viktor Kuncak, Martin C. Rinard
CORR
2008
Springer
107views Education» more  CORR 2008»
13 years 8 months ago
Metric Structures and Probabilistic Computation
Abstract. Continuous first-order logic is used to apply model-theoretic analysis to analytic structures (e.g. Hilbert spaces, Banach spaces, probability spaces, etc.). Classical co...
Wesley Calvert
BMCBI
2010
105views more  BMCBI 2010»
13 years 8 months ago
A knowledge-guided strategy for improving the accuracy of scoring functions in binding affinity prediction
Background: Current scoring functions are not very successful in protein-ligand binding affinity prediction albeit their popularity in structure-based drug designs. Here, we propo...
Tiejun Cheng, Zhihai Liu, Renxiao Wang
CAEPIA
2003
Springer
14 years 1 months ago
Social Analysis of Multi-agent Systems with Activity Theory
The development of software systems is a complex task that requires support techniques to guide the process and solve inconsistencies in its . In the agent paradigm, the use of soc...
Rubén Fuentes, Jorge J. Gómez-Sanz, ...