3663 search results - page 140 / 733 » Problems in the ontology of computer programs |
106
click to vote
ICCAD
1997
IEEE
15 years 2 months ago
1997
IEEE
We introduce a new technique to solve exactly a discrete optimization problem, based on the paradigm of “negative” thinking. The motivation is that when searching the space of...
IPPS
1999
IEEE
15 years 2 months ago
1999
IEEE
The ability to dynamically adapt an unstructured grid (or mesh) is a powerful tool for solving computational problems with evolving physical features; however, an efficient parall...
110
click to vote
FOCS
2005
IEEE
15 years 3 months ago
2005
IEEE
We give a general technique to obtain approximation mechanisms that are truthful in expectation. We show that for packing domains, any α-approximation algorithm that also bounds ...
ICML
2005
IEEE
15 years 10 months ago
2005
IEEE
MDPs are an attractive formalization for planning, but realistic problems often have intractably large state spaces. When we only need a partial policy to get from a fixed start s...
SODA
2008
ACM
14 years 11 months ago
2008
ACM
We present greedy algorithms for some classes of combinatorial packing and cover problems within the general formal framework of Hoffman and Schwartz' lattice polyhedra. Our ...