415 search results - page 18 / 83 » An efficient approximation for the Generalized Assignment Pr... |
ADHOC
2005
13 years 8 months ago
2005
This paper first studied the timeslot assignment problem in time division multiple access/code division multiple access (TDMA/CDMA) wireless ad hoc networks. Given a path P, we pr...
AUSAI
2010
Springer
13 years 5 months ago
2010
Springer
We study the problem of clustering uncertain objects whose locations are uncertain and described by probability density functions. We analyze existing pruning algorithms and experi...
CORR
2006
Springer
13 years 8 months ago
2006
Springer
In the maximum constraint satisfaction problem (Max CSP), one is given a finite collection of (possibly weighted) constraints on overlapping sets of variables, and the goal is to ...
TSP
2010
13 years 3 months ago
2010
We propose a variance-component probabilistic model for sparse signal reconstruction and model selection. The measurements follow an underdetermined linear model, where the unknown...
AI
2005
Springer
13 years 8 months ago
2005
Springer
One of the major approaches to approximation of logical theories is the upper and lower bounds approach introduced in (Selman and Kautz, 1991, 1996). In this paper, we address the...