530 search results - page 15 / 106 » An Algorithm for Approximating the Satisfiability Problem of... |
CDC
2008
IEEE
13 years 8 months ago
2008
IEEE
Minimizing the rank of a matrix subject to constraints is a challenging problem that arises in many applications in control theory, machine learning, and discrete geometry. This c...
ICALP
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We generalize the k-means algorithm presented by the authors [14] and show that the resulting algorithm can solve a larger class of clustering problems that satisfy certa...
MOBIHOC
2002
ACM
14 years 7 months ago
2002
ACM
Topology control problems are concerned with the assignment of power values to the nodes of an ad hoc network so that the power assignment leads to a graph topology satisfying som...
PODS
2003
ACM
14 years 8 months ago
2003
ACM
In recent years, the problem of indexing mobile objects has assumed great importance because of its relevance to a wide variety of applications. Most previous results in this area...
ATAL
2006
Springer
13 years 11 months ago
2006
Springer
The ability to coordinate effectively is critical for agents to accomplish their goals in a multi-agent system. A number of researchers have modeled the coordination problem for m...