Sciweavers

408 search results - page 49 / 82
» On a stochastic sequencing and scheduling problem
Sort
View
INFOCOM
2005
IEEE
14 years 1 months ago
Online time-constrained scheduling in linear networks
— We consider the problem of scheduling a sequence of packets over a linear network, where every packet has a source and a target, as well as a release time and a deadline by whi...
Joseph Naor, Adi Rosén, Gabriel Scalosub
DISOPT
2008
118views more  DISOPT 2008»
13 years 7 months ago
Approximation algorithm for minimizing total latency in machine scheduling with deliveries
We study the problem of minimizing total latency in machine scheduling with deliveries, which is defined as follows. There is a set of n jobs to be processed by a single machine a...
Asaf Levin, Michal Penn
CPAIOR
2009
Springer
14 years 2 months ago
The Polytope of Context-Free Grammar Constraints
Context-free grammar constraints enforce that a sequence of variables forms a word in a language defined by a context-free grammar. The constraint has received a lot of attention ...
Gilles Pesant, Claude-Guy Quimper, Louis-Martin Ro...
CP
2000
Springer
14 years 17 hour ago
Optimal Anytime Constrained Simulated Annealing for Constrained Global Optimization
Abstract. In this paper we propose an optimal anytime version of constrained simulated annealing (CSA) for solving constrained nonlinear programming problems (NLPs). One of the goa...
Benjamin W. Wah, Yixin Chen
FOCS
2007
IEEE
14 years 2 months ago
Adaptive Simulated Annealing: A Near-optimal Connection between Sampling and Counting
We present a near-optimal reduction from approximately counting the cardinality of a discrete set to approximately sampling elements of the set. An important application of our wo...
Daniel Stefankovic, Santosh Vempala, Eric Vigoda