Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Found
97029 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
Modelling and simulation on temperature and humidity decoupling of indoor environment
2017,
Wu Hao
An air conditioning system plays an important role in regulating the indoor environment and improving the...
Efficient Computation of Substring Equivalence Classes with Suffix Arrays
2017,
Narisawa Kazuyuki
This paper considers enumeration of substring equivalence classes introduced by Blumer et al. (J ACM...
General Caching Is Hard: Even with Small Pages
2017,
Sgall Ji
Caching (also known as paging ) is a classical problem concerning page replacement policies in...
Convex Hulls Under Uncertainty
2017,
Suri Subhash
We study the convex‐hull problem in a probabilistic setting, motivated by the need to handle data...
Set It and Forget It: Approximating the Set Once Strip Cover Problem
2017,
Bar-Noy Amotz
We consider the Set Once Strip Cover problem, in which n wireless sensors are deployed over a...
Full-Fledged Real-Time Indexing for Constant Size Alphabets
2017,
Kucherov Gregory
In this paper we describe a data structure that supports pattern matching queries on a dynamically...
On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs
2017,
Hong Seok-Hee
Fan‐planar graphs were recently introduced as a generalization of 1‐ planar graphs. A graph...
The Book Thickness of 1-Planar Graphs is Constant
2017,
Kaufmann Michael
In a book embedding, the vertices of a graph are placed on the ‘spine’ of a book and the edges...
Incremental Algorithm for Maintaining a DFS Tree for Undirected Graphs
2017,
Baswana Surender
Depth First Search (DFS) tree is a fundamental data structure for graphs used in solving various...
Efficient Sampling Methods for Discrete Distributions
2017,
Panagiotou Konstantinos
We study the fundamental problem of the exact and efficient generation of random values from a finite and...
Optimal Parallel Quantum Query Algorithms
2017,
Jeffery Stacey
We study the complexity of quantum query algorithms that make p queries in parallel in each timestep. This...
Building Efficient and Compact Data Structures for Simplicial Complexes
2017,
Boissonnat Jean-Daniel
The Simplex Tree (ST) is a recently introduced data structure that can represent abstract simplicial...
Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-Off Schedules
2017,
Antoniadis Antonios
We give a polynomial time algorithm to compute an optimal energy and fractional weighted flow...
On the Value of Job Migration in Online Makespan Minimization
2017,
Albers Susanne
Makespan minimization on identical parallel machines is a classical scheduling problem. We consider the...
Polynomial-Time Computation of Strong and n-Present-Value Optimal Policies in Markov Decision Chains
2017,
Veinott Arthur F
This paper studies the problem of finding a stationary strong present‐value optimal and, more...
Optimal Dynamic Risk Taking
2017,
Subramanian Ajay
We analyze a continuous‐time stochastic control problem that arises in the study of several...
An ϵ-Nash Equilibrium with High Probability for Strategic Customers in Heavy Traffic
2017,
Atar Rami
A multiclass queue with many servers is considered, where customers make a join‐or‐leave...
A Generalization of the Borkar-Meyn Theorem for Stochastic Recursive Inclusions
2017,
Bhatnagar Shalabh
In this paper, the stability theorem of Borkar and Meyn is extended to include the case when the mean...
Convergence Rate Analysis for the Alternating Direction Method of Multipliers with a Substitution Procedure for Separable Convex Programming
2017,
He Bingsheng
Recently, in He et al. [He BS, Tao M, Yuan XM (2012) Alternating direction method with Gaussian back...
The Power of Slightly More than One Sample in Randomized Load Balancing
2017,
Ying Lei
In many computing and networking applications, arriving tasks have to be routed to one of many servers,...
Scheduling Using Interactive Optimization Oracles for Constrained Queueing Networks
2017,
Suk Tonghoon
Ever since Tassiulas and Ephremides in 1992 proposed the maximum weight scheduling algorithm of throughput...
Matroids Are Immune to Braess’ Paradox
2017,
Fujishige Satoru
The famous Braess paradox describes the counterintuitive phenomenon in which, in certain settings, an...
Efficient Reinforcement Learning in Deterministic Systems with Value Function Generalization
2017,
Van Roy Benjamin
We consider the problem of reinforcement learning over episodes of a finite‐horizon deterministic...
Faster Convergence Rates of Relaxed Peaceman-Rachford and ADMM Under Regularity Assumptions
2017,
Davis Damek
In this paper, we provide a comprehensive convergence rate analysis of the Douglas‐Rachford...
First Page
10
11
12
13
14
Last Page
Papers per page:
8 Papers
16 Papers
24 Papers
32 Papers
48 Papers
Paper Filter
Search Text
Journals
Authors
Keywords
Countries
Year
1960
1961
1962
1963
1964
1965
1966
1967
1968
1969
1970
1971
1972
1973
1974
1975
1976
1977
1978
1979
1980
1981
1982
1983
1984
1985
1986
1987
1988
1989
1990
1991
1992
1993
1994
1995
1996
1997
1998
1999
2000
2001
2002
2003
2004
2005
2006
2007
2008
2009
2010
2011
2012
2013
2014
2015
2016
2017
2018
2019
2020
2021
2022
2023
2024
2025
1960
1961
1962
1963
1964
1965
1966
1967
1968
1969
1970
1971
1972
1973
1974
1975
1976
1977
1978
1979
1980
1981
1982
1983
1984
1985
1986
1987
1988
1989
1990
1991
1992
1993
1994
1995
1996
1997
1998
1999
2000
2001
2002
2003
2004
2005
2006
2007
2008
2009
2010
2011
2012
2013
2014
2015
2016
2017
2018
2019
2020
2021
2022
2023
2024
2025
Filter It!