4110 search results - page 74 / 822 » Efficient algorithms for the 2-gathering problem |
180
click to vote
TAINN
2005
Springer
15 years 9 months ago
2005
Springer
Satisfiability problem is an NP-complete problem that finds itself or its variants in many combinatorial problems. There exist many complete algorithms that give successful results...
136
Voted
CORR
2010
Springer
15 years 4 months ago
2010
Springer
The stable marriage (SM) problem has a wide variety of practical applications, ranging from matching resident doctors to hospitals, to matching students to schools, or more genera...
129
Voted
STOC
2010
ACM
15 years 8 months ago
2010
ACM
Given data drawn from a mixture of multivariate Gaussians, a basic problem is to accurately estimate the mixture parameters. We provide a polynomial-time algorithm for this proble...
133
click to vote
ATAL
2010
Springer
15 years 5 months ago
2010
Springer
In the course allocation problem, a university administrator seeks to efficiently and fairly allocate schedules of over-demanded courses to students with heterogeneous preferences...
98
Voted
CORR
2010
Springer
15 years 4 months ago
2010
Springer
DCSP (Distributed Constraint Satisfaction Problem) has been a very important research area in AI (Artificial Intelligence). There are many application problems in distributed AI t...