Sciweavers

91 search results - page 18 / 19
» On value sets of polynomials over a field
Sort
View
CIE
2007
Springer
14 years 1 months ago
Computational Complexity of Constraint Satisfaction
Abstract. The input to a constraint satisfaction problem (CSP) consists of a set of variables, each with a domain, and constraints between these variables formulated by relations o...
Heribert Vollmer
PODC
1999
ACM
13 years 11 months ago
Optimal, Distributed Decision-Making: The Case of no Communication
We present a combinatorial framework for the study of a natural class of distributed optimization problems that involve decisionmaking by a collection of n distributed agents in th...
Marios Mavronicolas, Paul G. Spirakis
VLDB
1998
ACM
101views Database» more  VLDB 1998»
13 years 11 months ago
On Optimal Node Splitting for R-trees
The problem of finding an optimal bipartition of a rectangle set has a direct impact on query performance of dynamic R-trees. During update operations, overflowed nodes need to be...
Yván J. García, Mario A. Lopez, Scot...
ATAL
2006
Springer
13 years 11 months ago
Efficient agent-based models for non-genomic evolution
Modeling dynamical systems composed of aggregations of primitive proteins is critical to the field of astrobiological science, which studies early evolutionary structures dealing ...
Nachi Gupta, Adrian K. Agogino, Kagan Tumer
BMCBI
2004
156views more  BMCBI 2004»
13 years 7 months ago
GeneXplorer: an interactive web application for microarray data visualization and analysis
Background: When publishing large-scale microarray datasets, it is of great value to create supplemental websites where either the full data, or selected subsets corresponding to ...
Christian A. Rees, Janos Demeter, John C. Matese, ...