Sciweavers

76 search results - page 9 / 16
» The Temporal Knapsack Problem and Its Solution
Sort
View
CCR
2005
129views more  CCR 2005»
13 years 7 months ago
The problem of synthetically generating IP traffic matrices: initial recommendations
There exist a wide variety of network design problems that require a traffic matrix as input in order to carry out performance evaluation. The research community has not had at it...
Antonio Nucci, Ashwin Sridharan, Nina Taft
AIPS
2009
13 years 8 months ago
Using Distance Estimates in Heuristic Search
This paper explores the use of an oft-ignored information source in heuristic search: a search-distance-to-go estimate. Operators frequently have different costs and cost-to-go is...
Jordan Tyler Thayer, Wheeler Ruml
ICML
2005
IEEE
14 years 8 months ago
Reinforcement learning with Gaussian processes
Gaussian Process Temporal Difference (GPTD) learning offers a Bayesian solution to the policy evaluation problem of reinforcement learning. In this paper we extend the GPTD framew...
Yaakov Engel, Shie Mannor, Ron Meir
VLSID
2008
IEEE
122views VLSI» more  VLSID 2008»
14 years 7 months ago
A Module Checking Based Converter Synthesis Approach for SoCs
Protocol conversion involves the use of a converter to control communication between two or more protocols such that desired system-level specifications can be satisfied. We invest...
Roopak Sinha, Partha S. Roop, Samik Basu
IPMI
2011
Springer
12 years 11 months ago
Actin Filament Segmentation Using Dynamic Programming
Abstract. We introduce a novel algorithm for actin filament segmentation in 2D TIRFM image sequences. This problem is difficult because actin filaments dynamically change shapes ...
Hongsheng Li, Tian Shen, Xiaolei Huang