Sciweavers

643 search results - page 75 / 129
» Parsing And Derivational Equivalence
Sort
View
JGO
2008
83views more  JGO 2008»
13 years 7 months ago
Computations with disjunctive cuts for two-stage stochastic mixed 0-1 integer programs
Two-stage stochastic mixed-integer programming (SMIP) problems with recourse are generally difficult to solve. This paper presents a first computational study of a disjunctive cut...
Lewis Ntaimo, Matthew W. Tanner
JSAC
2008
70views more  JSAC 2008»
13 years 7 months ago
LMMSE turbo equalization based on factor graphs
Abstract--In this paper, a vector-form factor graph representation is derived for intersymbol interference (ISI) channels. The resultant graphs have a tree-structure that avoids th...
Qinghua Guo, Li Ping
ENTCS
2007
96views more  ENTCS 2007»
13 years 7 months ago
An Observational Theory for Mobile Ad Hoc Networks
We propose a process calculus to study the behavioural theory of Mobile Ad Hoc Networks. The operational semantics of our calculus is given both in terms of a Reduction Semantics ...
Massimo Merro
ENTCS
2007
81views more  ENTCS 2007»
13 years 7 months ago
Self-assembling Trees
RCCS is a variant of Milner’s CCS where processes are allowed a controlled form of backtracking. It turns out that the RCCS reinterpretation of a CCS process is equivalent, in t...
Vincent Danos, Jean Krivine, Fabien Tarissan
EOR
2007
90views more  EOR 2007»
13 years 7 months ago
Arc routing problems with time-dependent service costs
This paper studies an arc routing problem with capacity constraints and time-dependent service costs. This problem is motivated by winter gritting applications where the ‘‘tim...
Mariam Tagmouti, Michel Gendreau, Jean-Yves Potvin