Sciweavers

1289 search results - page 197 / 258
» Complexity of Counting the Optimal Solutions
Sort
View
SIAMSC
2010
142views more  SIAMSC 2010»
14 years 8 months ago
Nested Iteration and First-Order System Least Squares for Incompressible, Resistive Magnetohydrodynamics
This paper develops a nested iteration algorithm to solve time-dependent nonlinear systems of partial differential equations. For each time step, Newton’s method is used to form...
J. H. Adler, Thomas A. Manteuffel, Stephen F. McCo...
ICRA
2003
IEEE
165views Robotics» more  ICRA 2003»
15 years 3 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...
CEC
2010
IEEE
14 years 11 months ago
An analysis of massively distributed evolutionary algorithms
Computational science is placing new demands on optimization algorithms as the size of data sets and the computational complexity of scientific models continue to increase. As thes...
Travis J. Desell, David P. Anderson, Malik Magdon-...
RTSS
1992
IEEE
15 years 1 months ago
Allocation of periodic task modules with precedence and deadline constraints in distributed real-time systems
This paper addresses the problem of allocating (assigning and scheduling) periodic task modules to processing nodes in distributed real-time systems subject to task precedence and ...
Chao-Ju Hou, Kang G. Shin
GPCE
2009
Springer
15 years 1 months ago
Mapping problem-space to solution-space features: a feature interaction approach
Mapping problem-space features into solution-space features is a fundamental configuration problem in software product line engineering. A configuration problem is defined as g...
Frans Sanen, Eddy Truyen, Wouter Joosen