Sciweavers

337 search results - page 18 / 68
» Semidefinite Programming Based Approximation Algorithms
Sort
View
JCP
2006
151views more  JCP 2006»
13 years 7 months ago
Simulated Annealing based Wireless Sensor Network Localization
In this paper, we describe a novel localization algorithm for ad hoc wireless sensor networks. Accurate selforganization and localization capability is a highly desirable character...
Anushiya A. Kannan, Guoqiang Mao, Branka Vucetic
PCM
2004
Springer
144views Multimedia» more  PCM 2004»
14 years 27 days ago
Dynamic Programming Based Adaptation of Multimedia Contents in UMA
Content adaptation is an effective solution to support the quality of service for multimedia services over heterogeneous networks. This paper deals with the accuracy and the real-...
Truong Cong Thang, Yong Ju Jung, Yong Man Ro
CP
2003
Springer
14 years 23 days ago
Approximated Consistency for Knapsack Constraints
Knapsack constraints are a key modeling structure in discrete optimization and form the core of many real-life problem formulations. Only recently, a cost-based filtering algorit...
Meinolf Sellmann
ICCV
2005
IEEE
14 years 9 months ago
A New Framework for Approximate Labeling via Graph Cuts
A new framework is presented that uses tools from duality theory of linear programming to derive graph-cut based combinatorial algorithms for approximating NP-hard classification ...
Nikos Komodakis, Georgios Tziritas
ICML
2002
IEEE
14 years 8 months ago
Algorithm-Directed Exploration for Model-Based Reinforcement Learning in Factored MDPs
One of the central challenges in reinforcement learning is to balance the exploration/exploitation tradeoff while scaling up to large problems. Although model-based reinforcement ...
Carlos Guestrin, Relu Patrascu, Dale Schuurmans