14158 search results - page 405 / 2832 » Generalized switch-setting problems |
220
click to vote
MFCS
2010
Springer
15 years 3 months ago
2010
Springer
The problem of finding a satisfying assignment for a 2-SAT formula that minimizes the number of variables that are set to 1 (min ones 2–sat) is NP-complete. It generalizes the w...
147
click to vote
NETWORKS
2010
15 years 3 months ago
2010
Let G = (V, E, Q) be a undirected graph, where V is the set of vertices, E is the set of edges, and Q = {Q1, . . . , Qq} is a partition of V into q subsets. We refer to Q1, . . . ...
173
Voted
ASSETS
2010
ACM
15 years 3 months ago
2010
ACM
Few web developers have been explicitly trained to create accessible web pages, and are unlikely to recognize subtle accessibility and usability concerns that disabled people face...
179
click to vote
IEEESCC
2009
IEEE
15 years 2 months ago
2009
IEEE
In this paper we look at combining and compressing a set of workflows, such that computation can be minimized. In this context, we look at two novel theoretical problems with appl...
117
Voted
CDC
2010
IEEE
15 years 18 hour ago
2010
IEEE
In this paper we consider the problem of gossiping in a network to diffuse the average of a sub-set of nodes, called sources, and directing it to another sub-set of nodes in the ne...