Sciweavers

1336 search results - page 202 / 268
» SMTP Path Analysis
Sort
View
WSC
2000
15 years 1 months ago
Mathematical programming models of discrete event system dynamics
Analytical models for the dynamics of some discrete event systems are introduced where the system trajectories are solutions to linear and mixed-integer programs. 1 BACKGROUND The...
Lee Schruben
WCE
2007
15 years 1 months ago
Scenario Generation Employing Copulas
—Multistage stochastic programs are effective for solving long-term planning problems under uncertainty. Such programs are usually based on scenario generation model about future...
Kristina Sutiene, Henrikas Pranevicius
BMCBI
2010
117views more  BMCBI 2010»
15 years 3 hour ago
New decoding algorithms for Hidden Markov Models using distance measures on labellings
Background: Existing hidden Markov model decoding algorithms do not focus on approximately identifying the sequence feature boundaries. Results: We give a set of algorithms to com...
Daniel G. Brown 0001, Jakub Truszkowski
COMCOM
2007
82views more  COMCOM 2007»
14 years 12 months ago
On application-level load balancing in FastReplica
— In the paper, we consider the problem of distributing large-size content to a fixed set of nodes. In contrast with the most existing end-system solutions to this problem, Fast...
Jangwon Lee, Gustavo de Veciana
CORR
2007
Springer
132views Education» more  CORR 2007»
14 years 12 months ago
Nodally 3-connected planar graphs and convex combination mappings
A barycentric mapping of a planar graph is a plane embedding in which every internal vertex is the average of its neighbours. A celebrated result of Tutte’s [16] is that if a pl...
Colm Ó'Dúnlaing