2109 search results - page 295 / 422 » Solving Necklace Constraint Problems |
169
click to vote
CDC
2009
IEEE
15 years 9 months ago
2009
IEEE
Abstract— Many problems associated with networked systems can be formulated as network utility maximization (NUM) problems. NUM problems maximize a global separable measure of ne...
144
click to vote
EVOW
2010
Springer
15 years 9 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...
151
click to vote
ICASSP
2010
IEEE
15 years 5 months ago
2010
IEEE
This paper addresses the problem of locating a single source from noisy range measurements in wireless sensor networks. An approximate solution to the maximum likelihood location ...
155
click to vote
SODA
2012
ACM
13 years 7 months ago
2012
ACM
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...
165
click to vote
AIPS
2011
14 years 8 months ago
2011
Applying learning techniques to acquire action models is an area of intense research interest. Most previous works in this area have assumed that there is a significant amount of...