2181 search results - page 69 / 437 » The restriction scaffold problem |
EAAI
2007
13 years 8 months ago
2007
Multi-agent systems are widely used to address large-scale distributed combinatorial applications in the real world. One such application is meeting scheduling (MS), which is deļ¬...
CPM
2004
Springer
14 years 2 months ago
2004
Springer
Given a set S = {s1, s2, . . . , sn} of strings each of length m, and an integer L, we study the following two problems. k-Closest Substring problem: ļ¬nd k center strings c1, c2,...
STOC
2003
ACM
14 years 9 months ago
2003
ACM
Given a database of n points in {0, 1}d, the partial match problem is: In response to a query x in {0, 1, }d, find a database point y such that for every i whenever xi = , we have...
ICALP
2007
Springer
14 years 2 months ago
2007
Springer
We present algebraic conditions on constraint languages Ī that ensure the hardness of the constraint satisfaction problem CSP(Ī) for complexity classes L, NL, P, NP and ModpL. Th...
FOCS
2006
IEEE
14 years 2 months ago
2006
IEEE
Combinatorial allocation problems require allocating items to players in a way that maximizes the total utility. Two such problems received attention recently, and were addressed ...