Sciweavers

2430 search results - page 369 / 486
» Computing Tutte Polynomials
Sort
View
HYBRID
2009
Springer
15 years 7 months ago
Trajectory Based Verification Using Local Finite-Time Invariance
Abstract. In this paper we propose a trajectory based reachability analysis by using local finite-time invariance property. Trajectory based analysis are based on the execution tra...
A. Agung Julius, George J. Pappas
109
Voted
BROADNETS
2004
IEEE
15 years 7 months ago
Diverse Routing for Shared Risk Resource Groups (SRRG) Failures in WDM Optical Networks
Failure resilience is one of the desired features of the Internet. Most of the traditional restoration architectures are based on single-failure assumption which is unrealistic. M...
Pallab Datta, Arun K. Somani
ATAL
2006
Springer
15 years 7 months ago
A hierarchical approach to efficient reinforcement learning in deterministic domains
Factored representations, model-based learning, and hierarchies are well-studied techniques for improving the learning efficiency of reinforcement-learning algorithms in large-sca...
Carlos Diuk, Alexander L. Strehl, Michael L. Littm...
122
Voted
FOCS
2004
IEEE
15 years 7 months ago
Extracting Randomness Using Few Independent Sources
In this work we give the first deterministic extractors from a constant number of weak sources whose entropy rate is less than 1/2. Specifically, for every > 0 we give an expl...
Boaz Barak, Russell Impagliazzo, Avi Wigderson
123
Voted
CONCUR
2006
Springer
15 years 7 months ago
Some Remarks on Definability of Process Graphs
We propose the notions of "density" and "connectivity" of infinite process graphs and investigate them in the context of the wellknown process algebras BPA and ...
Clemens Grabmayer, Jan Willem Klop, Bas Luttik