Zobrazeno 1 - 10
of 93
pro vyhledávání: '"Raible, Daniel"'
Autor:
Raible, Daniel Edward
This research demonstrates the feasibility of utilizing high intensity laser power beaming (HILPB) systems as a conduit for robust free-space optical communications over large distances and in challenging atmospheric conditions. The uniqueness of ver
Externí odkaz:
http://rave.ohiolink.edu/etdc/view?acc_num=csu1313065631
Autor:
Raible, Daniel Edward
This paper describes work supporting the development of a high intensity laser power beaming (HILPB) system for the purpose of wireless power transmission. The main contribution of this research is utilizing high intensity lasers to illuminate vertic
Externí odkaz:
http://rave.ohiolink.edu/etdc/view?acc_num=csu1210720146
Autor:
Raible, Daniel, Fernau, Henning
Given a directed graph $G=(V,A)$, the Directed Maximum Leaf Spanning Tree problem asks to compute a directed spanning tree (i.e., an out-branching) with as many leaves as possible. By designing a Branch-and-Reduced algorithm combined with the Measure
Externí odkaz:
http://arxiv.org/abs/0911.1900
Autor:
Binkele-Raible, Daniel, Erdélyi, Gábor, Fernau, Henning, Goldsmith, Judy, Mattei, Nicholas, Rothe, Jörg
We propose models for lobbying in a probabilistic environment, in which an actor (called "The Lobby") seeks to influence voters' preferences of voting for or against multiple issues when the voters' preferences are represented in terms of probabiliti
Externí odkaz:
http://arxiv.org/abs/0906.4431
We consider the NP-hard problem of finding a spanning tree with a maximum number of internal vertices. This problem is a generalization of the famous Hamiltonian Path problem. Our dynamic-programming algorithms for general and degree-bounded graphs h
Externí odkaz:
http://arxiv.org/abs/0811.1875
Autor:
Fernau, Henning, Fomin, Fedor V., Lokshtanov, Daniel, Raible, Daniel, Saurabh, Saket, Villanger, Yngve
The {\sc $k$-Leaf Out-Branching} problem is to find an out-branching (i.e. a rooted oriented spanning tree) with at least $k$ leaves in a given digraph. The problem has recently received much attention from the viewpoint of parameterized algorithms {
Externí odkaz:
http://arxiv.org/abs/0810.4796
}We study (vertex-disjoint) $P_2$-packings in graphs under a parameterized perspective. Starting from a maximal $P_2$-packing $\p$ of size $j$ we use extremal arguments for determining how many vertices of $\p$ appear in some $P_2$-packing of size $(
Externí odkaz:
http://arxiv.org/abs/0804.0570
Autor:
Raible, Daniel, Fernau, Henning
In {\sc MaxSat}, we ask for an assignment which satisfies the maximum number of clauses for a boolean formula in CNF. We present an algorithm yielding a run time upper bound of $O^*(2^{\frac{1}{6.2158}})$ for {\sc Max-2-Sat} (each clause contains at
Externí odkaz:
http://arxiv.org/abs/0803.3531
Autor:
Raible, Daniel J., Frey, Lauren C., Del Angel, Yasmin Cruz, Carlsen, Jessica, Hund, Dana, Russek, Shelley J., Smith, Bret, Brooks-Kayal, Amy R.
Publikováno v:
In Experimental Neurology September 2015 271:445-456
Autor:
Binkele-Raible, Daniel, Erdélyi, Gábor, Fernau, Henning, Goldsmith, Judy, Mattei, Nicholas, Rothe, Jörg
Publikováno v:
In Discrete Optimization February 2014 11:1-21