Sciweavers

2496 search results - page 247 / 500
» On covering by translates of a set
Sort
View
HEURISTICS
2010
15 years 1 months ago
A large neighbourhood search approach to the multi-activity shift scheduling problem
The challenge in shift scheduling lies in the construction of a set of work shifts, which are subject to specific regulations, in order to cover fluctuating staff demands. This pro...
Claude-Guy Quimper, Louis-Martin Rousseau
JSYML
2010
95views more  JSYML 2010»
15 years 1 months ago
Some natural decision problems in automatic graphs
For automatic and recursive graphs, we investigate the following problems: (A) existence of a Hamiltonian path and existence of an infinite path in a tree (B) existence of an Euler...
Dietrich Kuske, Markus Lohrey
SBMF
2010
Springer
164views Formal Methods» more  SBMF 2010»
15 years 1 months ago
A Decision Procedure for Bisimilarity of Generalized Regular Expressions
A notion of generalized regular expressions for a large class of systems modeled as coalgebras, and an analogue of Kleene's theorem and Kleene algebra, were recently proposed ...
Marcello M. Bonsangue, Georgiana Caltais, Eugen-Io...
TIT
2010
99views Education» more  TIT 2010»
15 years 1 months ago
Capacity of Channels With Action-Dependent States
We consider channels with action-dependent states: Given the message to be communicated, the transmitter chooses an action sequence that affects the formation of the channel state...
Tsachy Weissman
CPAIOR
2011
Springer
14 years 10 months ago
Manipulating MDD Relaxations for Combinatorial Optimization
Abstract. We study the application of limited-width MDDs (multivalued decision diagrams) as discrete relaxations for combinatorial optimization problems. These relaxations are used...
David Bergman, Willem Jan van Hoeve, John N. Hooke...