Sciweavers

15254 search results - page 311 / 3051
» A k
Sort
View
ISCAS
2007
IEEE
130views Hardware» more  ISCAS 2007»
16 years 1 months ago
Classes of stochastically switched (blinking) systems
—It is investigated to what extent the trajectories of a stochastically switched (blinking) system follow the corresponding trajectories of the averaged system. Four cases have t...
Martin Hasler, Igor Belykh, Vladimir N. Belykh
219
Voted
AAIM
2007
Springer
188views Algorithms» more  AAIM 2007»
16 years 29 days ago
Approximation Algorithms for the Graph Orientation Minimizing the Maximum Weighted Outdegree
Given an undirected graph G = (V, E) and a weight function w : E → Z+ , we consider the problem of orienting all edges in E so that the maximum weighted outdegree among all verti...
Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirot...
COCO
1990
Springer
106views Algorithms» more  COCO 1990»
15 years 10 months ago
The Boolean Hierarchy and the Polynomial Hierarchy: a Closer Connection
We show that if the Boolean hierarchy collapses to level k, then the polynomial hierarchy collapses to BH3(k), where BH3(k) is the kth level of the Boolean hierarchy over P 2 . Th...
Richard Chang, Jim Kadin
ESA
2008
Springer
134views Algorithms» more  ESA 2008»
15 years 8 months ago
A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry
The edge asymmetry of a directed, edge-weighted graph is defined as the maximum ratio of the weight of antiparallel edges in the graph, and can be used as a measure of the heterog...
Spyros Angelopoulos
ACID
2006
237views Algorithms» more  ACID 2006»
15 years 8 months ago
Parameterized Complexity of Finding Regular Induced Subgraphs
The r-Regular Induced Subgraph problem asks, given a graph G and a nonnegative integer k, whether G contains an r-regular induced subgraph of size at least k, that is, an induced ...
Hannes Moser, Dimitrios M. Thilikos