Browsing by Subject "Approximation algorithms"
Now showing items 1-6 of 6
-
Conference Object
Computing Nash equilibria for scheduling on restricted parallel links
(2004)We consider the problem of routing n users on m parallel links, under the restriction that each user may only be routed on a link from a certain set of allowed links for the user. Thus, the problem is equivalent to the ...
-
Article
A consistent velocity approximation for variable-density flow and transport in porous media
(2013)Using a finite-volume nodal-based code, we introduce a new consistent numerical scheme for approximating the seepage velocity in variable-density flow in porous media. It has been known from previous works that the lack ...
-
Article
Developing and investigating a pure Monte-Carlo module for transient neutron transport analysis
(2017)In the field of computational reactor physics, Monte-Carlo methodology is extensively used in the analysis of static problems while the transient behavior of the reactor core is mostly analyzed using deterministic algorithms. ...
-
Conference Object
Distributed stochastic power control for time-varying long-term and short-term fading wireless networks
(2007)In this paper, new time-varying wireless channel models that capture both the space and time variations of longterm and short-term fading wireless networks are developed. The proposed models are based on stochastic ...
-
Article
Minimum initial marking estimation in labeled petri nets
(2013)This technical note develops algorithms for estimating the minimum initial marking(s) following the observation of a sequence of labels produced by underlying transition activity in a known labeled Petri net (PN). Since ...
-
Conference Object
Towards feasible implementations of low-latency multi-writer atomic registers
(2011)This work explores implementations of multi-writer/multi-reader (MWMR) atomic registers in asynchronous, crash-prone, message-passing systems with the focus on low latency and computational feasibility. The efficiency of ...