Sciweavers

3446 search results - page 596 / 690
» A Reasoning Algorithm for pD*
Sort
View
COLT
1999
Springer
15 years 5 months ago
Regret Bounds for Prediction Problems
We present a unified framework for reasoning about worst-case regret bounds for learning algorithms. This framework is based on the theory of duality of convex functions. It brin...
Geoffrey J. Gordon
108
Voted
FPGA
1999
ACM
139views FPGA» more  FPGA 1999»
15 years 5 months ago
Trading Quality for Compile Time: Ultra-Fast Placement for FPGAs
The demand for high-speed FPGA compilation tools has occurred for three reasons: first, as FPGA device capacity has grown, the computation time devoted to placement and routing h...
Yaska Sankar, Jonathan Rose
SIGCOMM
1996
ACM
15 years 5 months ago
Improving the Start-Up Behavior of a Congestion Control Scheme for TCP
Based on experiments conducted in a network simulator and over real networks, this paper proposes changes to the congestion control scheme in current TCP implementations to improv...
Janey C. Hoe
VLDB
1997
ACM
126views Database» more  VLDB 1997»
15 years 5 months ago
Dynamic Memory Adjustment for External Mergesort
Sorting is a memory intensive operation whose performance is greatly affected by the amount of memory available as work space. When the input size is unknown or available memory s...
Weiye Zhang, Per-Åke Larson
ICS
1993
Tsinghua U.
15 years 5 months ago
Graph Contraction for Physical Optimization Methods: A Quality-Cost Tradeoff for Mapping Data on Parallel Computers
Mapping data to parallel computers aims at minimizing the execution time of the associated application. However, it can take an unacceptable amount of time in comparison with the ...
Nashat Mansour, Ravi Ponnusamy, Alok N. Choudhary,...