Sciweavers

16188 search results - page 419 / 3238
» The Optimal PAC Algorithm
Sort
View
IPCO
2007
108views Optimization» more  IPCO 2007»
15 years 8 months ago
Robust Combinatorial Optimization with Exponential Scenarios
Following the well-studied two-stage optimization framework for stochastic optimization [15, 18], we study approximation algorithms for robust two-stage optimization problems with ...
Uriel Feige, Kamal Jain, Mohammad Mahdian, Vahab S...
INFOCOM
2009
IEEE
16 years 1 months ago
Fast Algorithms and Performance Bounds for Sum Rate Maximization in Wireless Networks
Abstract— Sum rate maximization by power control is an important, challenging, and extensively studied problem in wireless networks. It is a nonconvex optimization problem and ac...
Chee-Wei Tan, Mung Chiang, R. Srikant
PPAM
2007
Springer
16 years 29 days ago
Parallel Simulated Annealing Algorithm for Graph Coloring Problem
Abstract. The paper describes an application of Parallel Simulated Annealing (PSA) for solving one of the most studied NP-hard optimization problems: Graph Coloring Problem (GCP). ...
Szymon Lukasik, Zbigniew Kokosinski, Grzegorz Swie...
ICRA
2005
IEEE
174views Robotics» more  ICRA 2005»
16 years 13 days ago
Fast Implementation of Lemke's Algorithm for Rigid Body Contact Simulation
— We present a fast method for solving rigid body contact problems with friction, based on optimizations incorporated into Lemke’s algorithm for solving linear complementarity ...
John E. Lloyd
195
Voted
CPM
2005
Springer
116views Combinatorics» more  CPM 2005»
16 years 11 days ago
Exact and Approximation Algorithms for DNA Tag Set Design
In this paper we propose new solution methods for designing tag sets for use in universal DNA arrays. First, we give integer linear programming formulations for two previous formal...
Ion I. Mandoiu, Dragos Trinca