Sciweavers

7129 search results - page 440 / 1426
» Approximation Algorithms for Treewidth
Sort
View
OL
2007
156views more  OL 2007»
15 years 5 months ago
A trust region SQP algorithm for mixed-integer nonlinear programming
We propose a modified sequential quadratic programming (SQP) method for solving mixed-integer nonlinear programming problems. Under the assumption that integer variables have a s...
Oliver Exler, Klaus Schittkowski
FOCS
2009
IEEE
16 years 1 months ago
On the Power of Randomization in Algorithmic Mechanism Design
In many settings the power of truthful mechanisms is severely bounded. In this paper we use randomization to overcome this problem. In particular, we construct an FPTAS for multi-...
Shahar Dobzinski, Shaddin Dughmi
CD
2005
Springer
15 years 12 months ago
A Decentralized Redeployment Algorithm for Improving the Availability of Distributed Systems
In distributed and mobile environments, the connections among the hosts on which a software system is running are often unstable. As a result of connectivity losses, the overall a...
Sam Malek, Marija Mikic-Rakic, Nenad Medvidovic
FOCM
2002
108views more  FOCM 2002»
15 years 6 months ago
Geometric Integration Algorithms on Homogeneous Manifolds
Given an ordinary differential equation on a homogeneous manifold, one can construct a "geometric integrator" by determining a compatible ordinary differential equation ...
Debra Lewis, Peter J. Olver
156
Voted
TCS
2010
15 years 4 months ago
Randomized priority algorithms
Borodin, Nielsen and Rackoff [13] introduced the class of priority algorithms as a framework for modeling deterministic greedy-like algorithms. In this paper we address the effe...
Spyros Angelopoulos, Allan Borodin