Sciweavers

2694 search results - page 90 / 539
» Fully Distributed Algorithms for Convex Optimization Problem...
Sort
View
JDCTA
2010
272views more  JDCTA 2010»
14 years 4 months ago
Optimal Control of Nonlinear Systems Using the Homotopy Perturbation Method: Infinite Horizon Case
This paper presents a new method for solving a class of infinite horizon nonlinear optimal control problems. In this method, first the original optimal control problem is transfor...
Amin Jajarmi, Hamidreza Ramezanpour, Arman Sargolz...
PPAM
2007
Springer
15 years 3 months 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...
64
Voted
WCNC
2008
IEEE
15 years 4 months ago
Cooperative Transmission in a Wireless Cluster Based on Flow Management
—In this paper, a cooperative transmission design for a multi-node wireless cluster network is presented. It is assumed that the nodes operate in half-duplex mode and that channe...
Debdeep Chatterjee, Tan F. Wong, Tat M. Lok
JMLR
2010
187views more  JMLR 2010»
14 years 4 months ago
SFO: A Toolbox for Submodular Function Optimization
In recent years, a fundamental problem structure has emerged as very useful in a variety of machine learning applications: Submodularity is an intuitive diminishing returns proper...
Andreas Krause
71
Voted
ICML
2006
IEEE
15 years 10 months ago
Learning algorithms for online principal-agent problems (and selling goods online)
In a principal-agent problem, a principal seeks to motivate an agent to take a certain action beneficial to the principal, while spending as little as possible on the reward. This...
Vincent Conitzer, Nikesh Garera