11345 search results - page 1753 / 2269 » Foundations of Computer Science |
150
Voted
FOCS
2009
IEEE
15 years 12 months ago
2009
IEEE
Polynomial time preprocessing to reduce instance size is one of the most commonly deployed heuristics to tackle computationally hard problems. In a parameterized problem, every in...
144
click to vote
FOCS
2009
IEEE
15 years 12 months ago
2009
IEEE
We study solution sets to systems of generalized linear equations of the form ℓi(x1, x2, · · · , xn) ∈ Ai (mod m) where ℓ1, . . . , ℓt are linear forms in n Boolean var...
125
click to vote
COMPLEX
2009
Springer
15 years 11 months ago
2009
Springer
: Development of capital intensive systems, such as offshore oil platforms or other industrial infrastructure, generally requires a significant amount of capital investment under v...
142
click to vote
SPIN
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. Symbolic reachability analysis provides a basis for the verification of software systems by offering algorithmic support for the exploration of the program state space ...
169
click to vote
FOCS
2008
IEEE
15 years 11 months ago
2008
IEEE
Given a complete undirected graph, a cost function on edges and a degree bound B, the degree bounded network design problem is to find a minimum cost simple subgraph with maximum...