Sciweavers

137 search results - page 26 / 28
» Critical Subgraphs of a Random Graph
Sort
View
ESA
2004
Springer
129views Algorithms» more  ESA 2004»
14 years 1 months ago
Contraction and Treewidth Lower Bounds
Edge contraction is shown to be a useful mechanism to improve lower bound heuristics for treewidth. A successful lower bound for treewidth is the degeneracy: the maximum over all ...
Hans L. Bodlaender, Arie M. C. A. Koster, Thomas W...
ICML
2006
IEEE
14 years 9 months ago
Fast direct policy evaluation using multiscale analysis of Markov diffusion processes
Policy evaluation is a critical step in the approximate solution of large Markov decision processes (MDPs), typically requiring O(|S|3 ) to directly solve the Bellman system of |S...
Mauro Maggioni, Sridhar Mahadevan
AAAI
2006
13 years 10 months ago
Identification and Evaluation of Weak Community Structures in Networks
Identifying intrinsic structures in large networks is a fundamental problem in many fields, such as engineering, social science and biology. In this paper, we are concerned with c...
Jianhua Ruan, Weixiong Zhang
TCAD
2008
106views more  TCAD 2008»
13 years 8 months ago
Track Routing and Optimization for Yield
Abstract--In this paper, we propose track routing and optimization for yield (TROY), the first track router for the optimization of yield loss due to random defects. As the probabi...
Minsik Cho, Hua Xiang, Ruchir Puri, David Z. Pan
BC
2005
106views more  BC 2005»
13 years 8 months ago
Phase transitions in the neuropercolation model of neural populations with mixed local and non-local interactions
Abstract We model the dynamical behavior of the neuropil, the densely interconnected neural tissue in the cortex, using neuropercolation approach. Neuropercolation generalizes phas...
Robert Kozma, Marko Puljic, Paul Balister, B&eacut...