14518 search results - page 286 / 2904 » Two Problems for Sophistication |
167
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
We consider the problem of computing a minimumdistortion bijection between two point-sets in R2 . We prove the first non-trivial inapproximability result for this problem, for the...
174
click to vote
AAIM
2008
Springer
16 years 1 months ago
2008
Springer
Abstract. Given a digraph D, the Minimum Leaf Out-Branching problem (MinLOB) is the problem of finding in D an out-branching with the minimum possible number of leaves, i.e., vert...
120
click to vote
GECCO
2007
Springer
16 years 24 days ago
2007
Springer
This paper is concerned with the Multi-Objective Next Release Problem (MONRP), a problem in search-based requirements engineering. Previous work has considered only single objecti...
205
click to vote
ICDT
2007
ACM
16 years 24 days ago
2007
ACM
Query containment is a fundamental problem of databases. Given two queries q1 and q2, it asks whether the set of answers to q1 is included in the set of answers to q2 for any datab...
139
click to vote
ATAL
2005
Springer
16 years 6 days ago
2005
Springer
Recent progress in Distributed Constraint Optimization Problems (DCOP) has led to a range of algorithms now available which differ in their amount of problem centralization. Probl...