Sciweavers

146 search results - page 28 / 30
» The Social Dynamics of Pair Programming
Sort
View
BIBM
2008
IEEE
112views Bioinformatics» more  BIBM 2008»
14 years 27 days ago
Fast Alignments of Metabolic Networks
Network alignments are extensively used for comparing, exploring, and predicting biological networks. Existing alignment tools are mostly based on isomorphic and homeomorphic embe...
Qiong Cheng, Piotr Berman, Robert W. Harrison, Ale...
BIBE
2007
IEEE
128views Bioinformatics» more  BIBE 2007»
14 years 23 days ago
QOMA2: Optimizing the alignment of many sequences
Abstract—We consider the problem of aligning multiple protein sequences with the goal of maximizing the SP (Sum-of-Pairs) score, when the number of sequences is large. The QOMA (...
Xu Zhang, Tamer Kahveci
ATAL
2005
Springer
13 years 12 months ago
Improving reinforcement learning function approximators via neuroevolution
Reinforcement learning problems are commonly tackled with temporal difference methods, which use dynamic programming and statistical sampling to estimate the long-term value of ta...
Shimon Whiteson
INFOCOM
2002
IEEE
13 years 11 months ago
Optimal Configuration of OSPF Aggregates
—Open Shortest Path First (OSPF) is a popular protocol for routing within an autonomous system (AS) domain. In order to scale for large networks containing hundreds and thousands...
Rajeev Rastogi, Yuri Breitbart, Minos N. Garofalak...
INFOCOM
2002
IEEE
13 years 11 months ago
Distributed Partial Information Management (DPIM) Schemes for Survivable Networks - Part I
—This paper describes a novel framework, called Distributed Partial Information Management (or DPIM). It addresses several major challenges in achieving efficient shared path pr...
Chunming Qiao, Dahai Xu