Keyword: computational analysis

Found 489 papers in total
Numerical homogenization of hybrid metal foams using the finite cell method
Numerical homogenization of hybrid metal foams using the finite cell method
2015,
We present a numerical homogenization approach for hybrid metal foams, i.e. foams that...
A saddle point least squares approach to mixed methods
A saddle point least squares approach to mixed methods
2015,
We investigate new PDE discretization approaches for solving variational formulations...
Open source software and crowdsourcing for energy analysis
Open source software and crowdsourcing for energy analysis
2012,
Informed energy decision making requires effective software, high‐quality input...
A Linear Algorithm for the Random Sampling from Regular Languages
A Linear Algorithm for the Random Sampling from Regular Languages
2012,
We present the first linear algorithm for the random sampling from regular languages....
Quasi‐Fully Dynamic Algorithms for Two‐Connectivity and Cycle Equivalence
Quasi‐Fully Dynamic Algorithms for Two‐Connectivity and Cycle Equivalence
2002,
We introduce a new class of dynamic graph algorithms called quasi‐fully dynamic...
Fault Identification in System‐Level Diagnosis: a Logic‐Based Framework and an O(n2\sqrt{t}/{\log n}) Algorithm
Fault Identification in System‐Level Diagnosis: a Logic‐Based Framework and an O(n2\sqrt{t}/{\log n}) Algorithm
2002,
Much research has been devoted to system‐level diagnosis–SLD. Two issues...
Erratum: An Approximation Algorithm for Minimum‐Cost Vertex‐Connectivity Problems
Erratum: An Approximation Algorithm for Minimum‐Cost Vertex‐Connectivity Problems
2002,
There is an error in our paper “An Approximation Algorithm for...
On solving the dual for portfolio selection by optimizing Conditional Value at Risk
On solving the dual for portfolio selection by optimizing Conditional Value at Risk
2011,
This note is focused on computational efficiency of the portfolio selection models...
Complexity of the VRP and SDVRP
Complexity of the VRP and SDVRP
2011,
In this paper we study the computational complexity of the vehicle routing problem...
Polynomial complexity of an interior point algorithm with a second order corrector step for symmetric cone programming
Polynomial complexity of an interior point algorithm with a second order corrector step for symmetric cone programming
2011,
In this paper, we propose a second order interior point algorithm for symmetric cone...
Predicting the Solution Time of Branch‐and‐Bound Algorithms for Mixed‐Integer Programs
Predicting the Solution Time of Branch‐and‐Bound Algorithms for Mixed‐Integer Programs
2011,
The most widely used progress measure for branch‐and‐bound (B&B)...
Computational complexity and solution algorithms for flowshop scheduling problems with the learning effect
Computational complexity and solution algorithms for flowshop scheduling problems with the learning effect
2011,
In this paper, we analyze the two‐machine flowshop problem with the makespan...
CLAM: Clustering Large Applications Using Metaheuristics
CLAM: Clustering Large Applications Using Metaheuristics
2011,
Clustering remains one of the most difficult challenges in data mining. This paper...
Fast Evaluation of Interlace Polynomials on Graphs of Bounded Treewidth
Fast Evaluation of Interlace Polynomials on Graphs of Bounded Treewidth
2011,
We consider the multivariate interlace polynomial introduced by Courcelle ( 2008),...
Multi-color pebble motion on graphs
Multi-color pebble motion on graphs
2010,
We consider a graph with n vertices, and p < n pebbles of m colors. A pebble move...
Complexity of some inverse shortest path lengths problems
Complexity of some inverse shortest path lengths problems
2010,
The input to an inverse shortest path lengths problem (ISPL) consists of a...
The hardness of train rearrangements
The hardness of train rearrangements
2009,
We derive several results on the computational complexity of train rearrangement...
Asymptotic optimality of the static frequency caching in the presence of correlated requests
Asymptotic optimality of the static frequency caching in the presence of correlated requests
2009,
It is well known that the static caching algorithm that keeps the most frequently...
NP-hardness of some competitive location models with probabilistic choice rules
NP-hardness of some competitive location models with probabilistic choice rules
2000,
Discrete versions of the medianoid and the centroid problems are considered under...
A fast computational algorithm for simulating round-robin service
A fast computational algorithm for simulating round-robin service
2009,
An efficient computation-based algorithm for effecting round-robin (RR) service in...
On the Complexity of Pure-Strategy Nash Equilibria in Congestion and Local-Effect Games
On the Complexity of Pure-Strategy Nash Equilibria in Congestion and Local-Effect Games
2008,
Rosenthal's congestion games constitute one of the few known classes of noncooperative...
Finding the Exact Integrality Gap for Small Traveling Salesman Problems
Finding the Exact Integrality Gap for Small Traveling Salesman Problems
2008,
The symmetric traveling salesman problem (STSP) is to find a minimum weight...
Conditions that obviate the no-free-lunch theorems for optimization
Conditions that obviate the no-free-lunch theorems for optimization
2007,
Roughly speaking, the no–free–lunch (NFL) theorems state that any blackbox...
Performance Guarantees of Local Search for Multiprocessor Scheduling
Performance Guarantees of Local Search for Multiprocessor Scheduling
2007,
Increasing interest has recently been shown in analyzing the worst–case behavior...
Papers per page: