Sciweavers

8413 search results - page 333 / 1683
» Ordering Problem Subgoals
Sort
View
CDC
2010
IEEE
135views Control Systems» more  CDC 2010»
15 years 1 months ago
A simple optimal power flow model with energy storage
The integration of renewable energy generation, such as wind power, into the electric grid is difficult because of the source intermittency and the large distance between generatio...
K. Mani Chandy, Steven H. Low, Ufuk Topcu, Huan Xu
DISOPT
2011
210views Education» more  DISOPT 2011»
15 years 1 months ago
The parameterized complexity of k-flip local search for SAT and MAX SAT
SAT and MAX SAT are among the most prominent problems for which local search algorithms have been successfully applied. A fundamental task for such an algorithm is to increase the...
Stefan Szeider
IANDC
2011
91views more  IANDC 2011»
15 years 1 months ago
Queries on Xml streams with bounded delay and concurrency
Query answering algorithms on Xml streams check answer candidates on the fly in order to avoid the unnecessary buffering whenever possible. The delay and concurrency of a query ...
Olivier Gauwin, Joachim Niehren, Sophie Tison
IJCV
2011
152views more  IJCV 2011»
15 years 1 months ago
Recovering Occlusion Boundaries from an Image
Occlusion reasoning is a fundamental problem in computer vision. In this paper, we propose an algorithm to recover the occlusion boundaries and depth ordering of free-standing str...
Derek Hoiem, Alexei A. Efros, Martial Hebert
JCO
2011
113views more  JCO 2011»
15 years 1 months ago
Hardness and algorithms for rainbow connection
An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection of a connected graph G, denoted r...
Sourav Chakraborty, Eldar Fischer, Arie Matsliah, ...