Sciweavers

8413 search results - page 395 / 1683
» Ordering Problem Subgoals
Sort
View
CAGD
2004
168views more  CAGD 2004»
15 years 6 months ago
A finite element method for surface restoration with smooth boundary conditions
In surface restoration usually a damaged region of a surface has to be replaced by a surface patch which restores the region in a suitable way. In particular one aims for C1-conti...
Ulrich Clarenz, Udo Diewald, G. Dziuk, Martin Rump...
COR
2010
129views more  COR 2010»
15 years 5 months ago
Flexible solutions in disjunctive scheduling: General formulation and study of the flow-shop case
We consider the context of decision support for schedule modification after the computation off-line of a predictive optimal (or near optimal) schedule. The purpose of this work i...
Mohamed Ali Aloulou, Christian Artigues
CP
2009
Springer
15 years 4 months ago
Minimizing the Maximum Number of Open Stacks by Customer Search
We describe a new exact solver for the minimization of open stacks problem (MOSP). By combining nogood recording with a branch and bound strategy based on choosing which customer s...
Geoffrey Chu, Peter J. Stuckey
MOBIHOC
2006
ACM
16 years 6 months ago
Mobile backbone networks --: construction and maintenance
We study a novel hierarchical wireless networking approach in which some of the nodes are more capable than others. In such networks, the more capable nodes can serve as Mobile Ba...
Anand Srinivas, Gil Zussman, Eytan Modiano
GECCO
2007
Springer
241views Optimization» more  GECCO 2007»
16 years 25 days ago
Binary ant algorithm
When facing dynamic optimization problems the goal is no longer to find the extrema, but to track their progression through the space as closely as possible. Over these kind of ov...
Carlos Fernandes, Agostinho C. Rosa, Vitorino Ramo...