Sciweavers

2373 search results - page 85 / 475
» Complexities for generalized models of self-assembly
Sort
View
FOCS
1997
IEEE
15 years 8 months ago
Randomized and Deterministic Algorithms for the Dimension of Algebraic Varieties
We prove old and new results on the complexity of computing the dimension of algebraic varieties. In particular, we show that this problem is NP-complete in the Blum-Shub-Smale mo...
Pascal Koiran
ATAL
2011
Springer
14 years 4 months ago
Learning action models for multi-agent planning
In multi-agent planning environments, action models for each agent must be given as input. However, creating such action models by hand is difficult and time-consuming, because i...
Hankz Hankui Zhuo, Hector Muñoz-Avila, Qian...
JCPHY
2011
133views more  JCPHY 2011»
14 years 7 months ago
A Riemann solver for single-phase and two-phase shallow flow models based on relaxation. Relations with Roe and VFRoe solvers
We present a Riemann solver derived by a relaxation technique for classical single-phase shallow flow equations and for a two-phase shallow flow model describing a mixture of so...
Marica Pelanti, François Bouchut, Anne Mang...
MSR
2011
ACM
14 years 7 months ago
A simpler model of software readability
Software readability is a property that influences how easily a given piece of code can be read and understood. Since readability can affect maintainability, quality, etc., prog...
Daryl Posnett, Abram Hindle, Premkumar T. Devanbu
JMLR
2010
135views more  JMLR 2010»
14 years 11 months ago
Structured Prediction Cascades
Structured prediction tasks pose a fundamental trade-off between the need for model complexity to increase predictive power and the limited computational resources for inference i...
David Weiss, Benjamin Taskar