Sciweavers

719 search results - page 33 / 144
» Adaptive Online Time Allocation to Search Algorithms
Sort
View
BMCBI
2007
111views more  BMCBI 2007»
14 years 9 months ago
MotifCombinator: a web-based tool to search for combinations of cis-regulatory motifs
Background: A combination of multiple types of transcription factors and cis-regulatory elements is often required for gene expression in eukaryotes, and the combinatorial regulat...
Mamoru Kato, Tatsuhiko Tsunoda
ICDM
2007
IEEE
157views Data Mining» more  ICDM 2007»
14 years 11 months ago
Training Conditional Random Fields by Periodic Step Size Adaptation for Large-Scale Text Mining
For applications with consecutive incoming training examples, on-line learning has the potential to achieve a likelihood as high as off-line learning without scanning all availabl...
Han-Shen Huang, Yu-Ming Chang, Chun-Nan Hsu
ATAL
2007
Springer
15 years 4 months ago
Approximate and online multi-issue negotiation
This paper analyzes bilateral multi-issue negotiation between selfinterested autonomous agents. The agents have time constraints in the form of both deadlines and discount factors...
S. Shaheen Fatima, Michael Wooldridge, Nicholas R....
SIGECOM
2005
ACM
169views ECommerce» more  SIGECOM 2005»
15 years 3 months ago
Online auctions with re-usable goods
This paper concerns the design of mechanisms for online scheduling in which agents bid for access to a re-usable resource such as processor time or wireless network access. Each a...
Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Mo...
NIPS
1993
14 years 11 months ago
Optimal Stochastic Search and Adaptive Momentum
Stochastic optimization algorithms typically use learning rate schedules that behave asymptotically as (t) = 0=t. The ensemble dynamics (Leen and Moody, 1993) for such algorithms ...
Todd K. Leen, Genevieve B. Orr