641 search results - page 101 / 129 » Improved Bounds for Wireless Localization |
CDC
2008
IEEE
14 years 2 months ago
2008
IEEE
Abstract— We consider a convex unconstrained optimization problem that arises in a network of agents whose goal is to cooperatively optimize the sum of the individual agent objec...
ICANN
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Tuning hyper-parameters is a necessary step to improve learning algorithm performances. For Support Vector Machine classifiers, adjusting kernel parameters increases dra...
EVOW
2010
Springer
13 years 11 months ago
2010
Springer
Instances of constraint satisfaction problems can be solved efficiently if they are representable as a tree decomposition of small width. Unfortunately, the task of finding a deco...
FLAIRS
2008
13 years 10 months ago
2008
Preferences in constraint problems are common but significant in many real world applications. In this paper, we extend our conditional and composite CSP (CCCSP) framework, managi...
APPROX
2008
Springer
13 years 9 months ago
2008
Springer
We consider testing directed graphs for being Eulerian in the orientation model introduced in [15]. Despite the local nature of the property of being Eulerian, it turns out to be ...