Sciweavers

21 search results - page 4 / 5
» Pebbling and optimal pebbling in graphs
Sort
View
CORR
2010
Springer
149views Education» more  CORR 2010»
13 years 5 months ago
Pebbling and Branching Programs Solving the Tree Evaluation Problem
We study restricted computation models related to the tree evaluation problem. The TEP was introduced in earlier work as a simple candidate for the (very) long term goal of separa...
Dustin Wehr
ICRA
2010
IEEE
96views Robotics» more  ICRA 2010»
13 years 4 months ago
Towards dynamic team formation for robot ensembles
Abstract— We present an investigation of dynamic team formation strategies for robot ensembles performing a collection of nd two-robot tasks. Specifically, we consider the abstr...
T. William Mather, M. Ani Hsieh, Emilio Frazzoli
FCT
2003
Springer
13 years 11 months ago
Graph Searching, Elimination Trees, and a Generalization of Bandwidth
The bandwidth minimization problem has a long history and a number of practical applications. In this paper we introduce a natural extension of bandwidth to partially ordered layo...
Fedor V. Fomin, Pinar Heggernes, Jan Arne Telle
CORR
2011
Springer
143views Education» more  CORR 2011»
12 years 9 months ago
Towards Understanding and Harnessing the Potential of Clause Learning
Efficient implementations of DPLL with the addition of clause learning are the fastest complete Boolean satisfiability solvers and can handle many significant real-world problem...
Paul Beame, Henry A. Kautz, Ashish Sabharwal