2168 search results - page 73 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
132
Voted
FOCS
2007
IEEE
15 years 10 months ago
2007
IEEE
Submodular maximization generalizes many important problems including Max Cut in directed/undirected graphs and hypergraphs, certain constraint satisfaction problems and maximum f...
216
click to vote
WIA
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. State elimination is an intuitive and easy-to-implement algorithm that computes a regular expression from a finite-state automaton (FA). The size of a regular expression...
152
Voted
AAAI
2006
15 years 5 months ago
2006
Reinforcement learning problems are commonly tackled with temporal difference methods, which attempt to estimate the agent's optimal value function. In most real-world proble...
132
Voted
SIGGRAPH
1993
ACM
15 years 7 months ago
1993
ACM
Many of the current radiosity algorithms create a piecewise constant approximation to the actual radiosity. Through interpolation and extrapolation, a continuous solution is obtai...
149
Voted
EWSN
2011
Springer
14 years 7 months ago
2011
Springer
Highly efficient compression provides a promising approach to address the transmission and computation challenges imposed by moving object tracking applications on resource constra...