Sciweavers

761 search results - page 47 / 153
» Efficient Approximation Algorithms for the Subset-Sums Equal...
Sort
View
CRV
2007
IEEE
101views Robotics» more  CRV 2007»
13 years 11 months ago
Energy Efficient Robot Rendezvous
We examine the problem of finding a single meeting location for a group of heterogeneous autonomous mobile robots, such that the total system cost of traveling to the rendezvous i...
Pawel Zebrowski, Yaroslav Litus, Richard T. Vaugha...
SIAMJO
2010
97views more  SIAMJO 2010»
13 years 2 months ago
A Newton-CG Augmented Lagrangian Method for Semidefinite Programming
Abstract. We consider a Newton-CG augmented Lagrangian method for solving semidefinite programming (SDP) problems from the perspective of approximate semismooth Newton methods. In ...
Xin-Yuan Zhao, Defeng Sun, Kim-Chuan Toh
IPPS
2002
IEEE
14 years 20 days ago
Approximate String Matching in LDAP Based on Edit Distance
As the E-Commerce rapidly grows up, searching data is almost necessary in every application. Approximate string matching problems play a very important role to search with errors....
Chi-Chien Pan, Kai-Hsiang Yang, Tzao-Lin Lee
ICDE
2007
IEEE
140views Database» more  ICDE 2007»
14 years 9 months ago
Selecting Stars: The k Most Representative Skyline Operator
Skyline computation has many applications including multi-criteria decision making. In this paper, we study the problem of selecting k skyline points so that the number of points,...
Xuemin Lin, Yidong Yuan, Qing Zhang, Ying Zhang
ATAL
2010
Springer
13 years 2 months ago
Approximate dynamic programming with affine ADDs
The Affine ADD (AADD) is an extension of the Algebraic Decision Diagram (ADD) that compactly represents context-specific, additive and multiplicative structure in functions from a...
Scott Sanner, William T. B. Uther, Karina Valdivia...