Sciweavers

2722 search results - page 370 / 545
» Hastily formed networks
Sort
View
GECCO
1999
Springer
133views Optimization» more  GECCO 1999»
15 years 11 months ago
Evolution of Goal-Directed Behavior from Limited Information in a Complex Environment
In this paper, we apply an evolutionary algorithm to learning behavior on a novel, interesting task to explore the general issue of learning e ective behaviors in a complex enviro...
Matthew R. Glickman, Katia P. Sycara
ASPLOS
1998
ACM
15 years 10 months ago
Overlapping Execution with Transfer Using Non-Strict Execution for Mobile Programs
In order to execute a program on a remote computer, it must first be transferred over a network. This transmission incurs the overhead of network latency before execution can beg...
Chandra Krintz, Brad Calder, Han Bok Lee, Benjamin...
ANNPR
2006
Springer
15 years 10 months ago
Simple and Effective Connectionist Nonparametric Estimation of Probability Density Functions
Abstract. Estimation of probability density functions (pdf) is one major topic in pattern recognition. Parametric techniques rely on an arbitrary assumption on the form of the unde...
Edmondo Trentin
COCOON
2008
Springer
15 years 8 months ago
Quasi-bicliques: Complexity and Binding Pairs
Abstract. Protein-protein interactions (PPIs) are one of the most important mechanisms in cellular processes. To model protein interaction sites, recent studies have suggested to f...
Xiaowen Liu, Jinyan Li, Lusheng Wang
CONEXT
2008
ACM
15 years 8 months ago
AS alliance: cooperatively improving resilience of intra-alliance communication
The current interdomain routing protocol, BGP, is not resilient to a path failure due to its single-path and slowlyconverging route calculation. This paper proposes a novel approa...
Yuichiro Hei, Akihiro Nakao, Toru Hasegawa, Tomohi...