13376 search results - page 532 / 2676 » Problem Solving with |
182
click to vote
ALGOSENSORS
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. In this paper, we investigate the possibility to deterministically solve the gathering problem (GP) with weak robots (anonymous, autonomous, disoriented, deaf and dumb, a...
205
click to vote
VLDB
2005
ACM
16 years 23 days ago
2005
ACM
Summarization of query results is an important problem for many OLAP applications. The Minimum Description Length principle has been applied in various studies to provide summarie...
178
Voted
IPL
2006
15 years 7 months ago
2006
: In this paper we consider the vertex ranking problem of weighted trees. We show that this problem is strongly NP-hard. We also give a polynomial-time reduction from the problem o...
217
click to vote
PVM
2005
Springer
16 years 23 days ago
2005
Springer
We consider a parallel decomposition technique for solving the large quadratic programs arising in training the learning methodology Support Vector Machine. At each iteration of th...
203
click to vote
WIOPT
2010
IEEE
15 years 5 months ago
2010
IEEE
We consider the resource allocation (RA) problem of maximizing the weighted sum of the minimal user rates (WSMR) of coordinated cells subject to a total power constraint at each ba...