Sciweavers

2373 search results - page 246 / 475
» Complexities for generalized models of self-assembly
Sort
View
ISAAC
2007
Springer
158views Algorithms» more  ISAAC 2007»
16 years 23 days ago
On the Expressive Power of Planar Perfect Matching and Permanents of Bounded Treewidth Matrices
Valiant introduced some 25 years ago an algebraic model of computation along with the complexity classes VP and VNP, which can be viewed as analogues of the classical classes P and...
Uffe Flarup, Pascal Koiran, Laurent Lyaudet
CONCUR
1998
Springer
15 years 11 months ago
Algebraic Techniques for Timed Systems
Performance evaluation is a central issue in the design of complex real-time systems. In this work, we propose an extension of socalled "Max-Plus" algebraic techniques to...
Albert Benveniste, Claude Jard, Stephane Gaubert
JMIV
2006
124views more  JMIV 2006»
15 years 6 months ago
Segmentation of a Vector Field: Dominant Parameter and Shape Optimization
Vector field segmentation methods usually belong to either of three classes: methods which segment regions homogeneous in direction and/or norm, methods which detect discontinuiti...
Tristan Roy, Eric Debreuve, Michel Barlaud, Gilles...
ICRA
2003
IEEE
165views Robotics» more  ICRA 2003»
15 years 12 months ago
Multi-robot task-allocation through vacancy chains
Existing task allocation algorithms generally do not consider the effects of task interaction, such as interference, but instead assume that tasks are independent. That assumptio...
Torbjørn S. Dahl, Maja J. Mataric, Gaurav S...
NIPS
2000
15 years 8 months ago
Learning Continuous Distributions: Simulations With Field Theoretic Priors
Learning of a smooth but nonparametric probability density can be regularized using methods of Quantum Field Theory. We implement a field theoretic prior numerically, test its eff...
Ilya Nemenman, William Bialek