13603 search results - page 175 / 2721 » On the Computational Complexity of Cut-Reduction |
145
click to vote
DATAMINE
2007
15 years 6 months ago
2007
Recent work has looked at extending clustering algorithms with instance level must-link (ML) and cannot-link (CL) background information. Our work introduces δ and ǫ cluster lev...
179
click to vote
JSAC
2006
15 years 6 months ago
2006
We consider the problem of traffic grooming in WDM path, star, and tree networks. Traffic grooming is a variant of the well-known logical topology design, and is concerned with the...
171
click to vote
CORR
2002
Springer
15 years 6 months ago
2002
Springer
In multiagent settings where the agents have different preferences, preference aggregation is a central issue. Voting is a general method for preference aggregation, but seminal r...
189
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
In this paper we present an equilibrium value based framework for solving SDPs via the multiplicative weight update method which is different from the one in Kale's thesis [K...
176
click to vote
AI
2006
Springer
15 years 6 months ago
2006
Springer
Coalition formation is a key problem in automated negotiation among self-interested agents, and other multiagent applications. A coalition of agents can sometimes accomplish thing...