Sciweavers

499 search results - page 34 / 100
» A Dynamic-Programming Based ASP-Solver
Sort
View
ICML
1996
IEEE
14 years 11 months ago
Sensitive Discount Optimality: Unifying Discounted and Average Reward Reinforcement Learning
Research in reinforcementlearning (RL)has thus far concentrated on two optimality criteria: the discounted framework, which has been very well-studied, and the averagereward frame...
Sridhar Mahadevan
ICC
2009
IEEE
129views Communications» more  ICC 2009»
14 years 5 months ago
Restless Watchdog: Monitoring Multiple Bands with Blind Period in Cognitive Radio Systems
— Spectrum sensing, which monitors the spectrum activity, is studied for cognitive radio systems using multiple frequency bands with non-negligible band switching time (blind per...
Husheng Li
ICCAD
1998
IEEE
81views Hardware» more  ICCAD 1998»
14 years 3 months ago
A simultaneous routing tree construction and fanout optimization algorithm
- This paper presents an optimal algorithm for solving the problem of simultaneous fanout optimization and routing tree construction for an ordered set of critical sinks. The algor...
Amir H. Salek, Jinan Lou, Massoud Pedram
COCOON
2007
Springer
14 years 2 months ago
Improved Exact Algorithms for Counting 3- and 4-Colorings
Abstract. We introduce a generic algorithmic technique and apply it on decision and counting versions of graph coloring. Our approach is based on the following idea: either a graph...
Fedor V. Fomin, Serge Gaspers, Saket Saurabh
CORR
1999
Springer
145views Education» more  CORR 1999»
13 years 10 months ago
Subgraph Isomorphism in Planar Graphs and Related Problems
We solve the subgraph isomorphism problem in planar graphs in linear time, for any pattern of constant size. Our results are based on a technique of partitioning the planar graph ...
David Eppstein