2137 search results - page 179 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
163
click to vote
ISCAS
2005
IEEE
15 years 12 months ago
2005
IEEE
— Simulated Evolution (SimE) is a sound stochastic approximation algorithm based on the principles of adaptation. If properly engineered it is possible for SimE to reach nearopti...
189
click to vote
STOC
2007
ACM
16 years 6 months ago
2007
ACM
We present a polynomial time approximation scheme (PTAS) for the minimum feedback arc set problem on tournaments. A simple weighted generalization gives a PTAS for KemenyYoung ran...
200
click to vote
CVPR
2010
IEEE
16 years 2 months ago
2010
IEEE
Maximum a posteriori (MAP) inference in Markov Random Fields (MRFs) is an NP-hard problem, and thus research has focussed on either finding efficiently solvable subclasses (e.g. t...
152
click to vote
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
—We consider a wireless network of n nodes that communicate over a common wireless medium under some interference constraints. Our work is motivated by the need for an efficient...
140
click to vote
CIKM
2010
Springer
15 years 5 months ago
2010
Springer
We consider the problem of recommending the best set of k items when there is an inherent ordering between items, expressed as a set of prerequisites (e.g., the movie ‘Godfather...