Sciweavers

1380 search results - page 52 / 276
» Computing the optimal strategy to commit to
Sort
View
IMR
2003
Springer
14 years 28 days ago
A Crystalline, Red Green Strategy for Meshing Highly Deformable Objects with Tetrahedra
Motivated by Lagrangian simulation of elastic deformation, we propose a new tetrahedral mesh generation algorithm that produces both high quality elements and a mesh that is well ...
Neil Molino, Robert Bridson, Joseph Teran, Ronald ...
DCC
2007
IEEE
14 years 7 months ago
Bayesian Detection in Bounded Height Tree Networks
We study the detection performance of large scale sensor networks, configured as trees with bounded height, in which information is progressively compressed as it moves towards th...
Wee-Peng Tay, John N. Tsitsiklis, Moe Z. Win
APSEC
2001
IEEE
13 years 11 months ago
Scheduling Software Projects to Minimize the Development Time and Cost with a Given Staff
A probabilistic scheduling model for software projects is presented. The model explicitly takes a scheduling strategy as input. When the scheduling strategy is fixed, the model ou...
Frank Padberg
PPSN
1998
Springer
13 years 12 months ago
Restart Scheduling for Genetic Algorithms
Abstract. In order to escape from local optima, it is standard practice to periodically restart a genetic algorithm according to some restart criteria/policy. This paper addresses ...
Alex S. Fukunaga
WRLA
2010
13 years 6 months ago
Folding Variant Narrowing and Optimal Variant Termination
Abstract. If a set of equations E∪Ax is such that E is confluent, terminating, and coherent modulo Ax, narrowing with E modulo Ax provides a complete E∪Ax-unification algorit...
Santiago Escobar, Ralf Sasse, José Meseguer