Sciweavers

1290 search results - page 187 / 258
» New algorithms of the Q-learning type
Sort
View
AADEBUG
2005
Springer
14 years 2 months ago
Tdb: a source-level debugger for dynamically translated programs
Debugging techniques have evolved over the years in response to changes in programming languages, implementation techniques, and user needs. A new type of implementation vehicle f...
Naveen Kumar, Bruce R. Childers, Mary Lou Soffa
CPM
2009
Springer
122views Combinatorics» more  CPM 2009»
14 years 3 months ago
Haplotype Inference Constrained by Plausible Haplotype Data
The haplotype inference problem (HIP) asks to find a set of haplotypes which resolve a given set of genotypes. This problem is of enormous importance in many practical fields, su...
Michael R. Fellows, Tzvika Hartman, Danny Hermelin...
PAM
2005
Springer
14 years 2 months ago
A Merged Inline Measurement Method for Capacity and Available Bandwidth
— We have proposed a new TCP version, called ImTCP (Inline measurement TCP), in [1]. The ImTCP sender adjusts the transmission intervals of data packets, and then utilizes the ar...
Cao Le Thanh Man, Go Hasegawa, Masayuki Murata
WEBDB
2010
Springer
178views Database» more  WEBDB 2010»
14 years 1 months ago
Using Latent-Structure to Detect Objects on the Web
An important requirement for emerging applications which aim to locate and integrate content distributed over the Web is to identify pages that are relevant for a given domain or ...
Luciano Barbosa, Juliana Freire
SWAT
1992
Springer
147views Algorithms» more  SWAT 1992»
14 years 25 days ago
Efficient Rebalancing of Chromatic Search Trees
In PODS'91, Nurmi and Soisalon-Soininen presented a new type of binary search tree for databases, which they call a chromatic tree. The aim is to improve runtime performance ...
Joan Boyar, Kim S. Larsen