Sciweavers

242 search results - page 8 / 49
» Provably Bounded Optimal Agents
Sort
View
EVOW
2007
Springer
14 years 2 months ago
Combining Lagrangian Decomposition with an Evolutionary Algorithm for the Knapsack Constrained Maximum Spanning Tree Problem
We present a Lagrangian decomposition approach for the Knapsack Constrained Maximum Spanning Tree problem yielding upper bounds as well as heuristic solutions. This method is furth...
Sandro Pirkwieser, Günther R. Raidl, Jakob Pu...
ICPR
2006
IEEE
14 years 9 months ago
Optimal Estimation of Perspective Camera Pose
In this paper we propose a practical and efficient method for finding the globally optimal solution to the problem of camera pose estimation for calibrated cameras. While traditio...
Carl Olsson, Fredrik Kahl, Magnus Oskarsson
ET
2006
55views more  ET 2006»
13 years 7 months ago
Test Planning and Test Resource Optimization for Droplet-Based Microfluidic Systems
Recent years have seen the emergence of dropletbased microfluidic systems for safety-critical biomedical applications. In order to ensure reliability, microsystems incorporating m...
Fei Su, Sule Ozev, Krishnendu Chakrabarty
ICDM
2008
IEEE
122views Data Mining» more  ICDM 2008»
14 years 2 months ago
Nonnegative Matrix Factorization for Combinatorial Optimization: Spectral Clustering, Graph Matching, and Clique Finding
Nonnegative matrix factorization (NMF) is a versatile model for data clustering. In this paper, we propose several NMF inspired algorithms to solve different data mining problems....
Chris H. Q. Ding, Tao Li, Michael I. Jordan
SIGECOM
2006
ACM
88views ECommerce» more  SIGECOM 2006»
14 years 1 months ago
Implementation with a bounded action space
While traditional mechanism design typically assumes isomorphism between the agents’ type- and action spaces, in many situations the agents face strict restrictions on their act...
Liad Blumrosen, Michal Feldman