Sciweavers

8413 search results - page 167 / 1683
» Ordering Problem Subgoals
Sort
View
RSA
2006
104views more  RSA 2006»
13 years 10 months ago
The satisfiability threshold for randomly generated binary constraint satisfaction problems
Abstract. We study two natural models of randomly generated constraint satisfaction problems. We determine how quickly the domain size must grow with n to ensure that these models ...
Alan M. Frieze, Michael Molloy
MOC
2002
151views more  MOC 2002»
13 years 10 months ago
Mixed finite element methods for unilateral problems: convergence analysis and numerical studies
In this paper, we propose and study different mixed variational methods in order to approximate with finite elements the unilateral problems arising in contact mechanics. The discr...
Patrice Coorevits, Patrick Hild, Khalid Lhalouani,...
ORL
2007
112views more  ORL 2007»
13 years 10 months ago
Competitive analysis of a dispatch policy for a dynamic multi-period routing problem
We analyze a simple and natural on-line algorithm (dispatch policy) for a dynamic multiperiod uncapacitated routing problem, in which at the beginning of each time period a set of...
Enrico Angelelli, Martin W. P. Savelsbergh, Maria ...
OSS
2007
Springer
14 years 4 months ago
Release Management in Free Software Projects: Practices and Problems
Abstract. Release management plays an important role in every software project since it is concerned with the delivery of a high quality product to end-users. This paper explores r...
Martin Michlmayr, Francis Hunt, David Probert
ETFA
2008
IEEE
14 years 12 days ago
Descending Deviation Optimization techniques for scheduling problems
In factory automation, production line scheduling entails a number of competing issues. Finding optimal configurations often requires use of local search techniques. Local search l...
Kevin McCarty, Milos Manic