Sciweavers

2767 search results - page 167 / 554
» Universal Exponentiation Algorithm
Sort
View
85
Voted
ROBOCUP
1999
Springer
138views Robotics» more  ROBOCUP 1999»
15 years 2 months ago
All Botz
This paper provides general information about research at the University of Auckland into autonomous agents in highly dynamic environments, in particular in RoboCup. The paper desc...
Jacky Baltes, Nicholas Hildreth, David Maplesden
63
Voted
STOC
1992
ACM
91views Algorithms» more  STOC 1992»
15 years 2 months ago
Randomized versus Nondeterministic Communication Complexity
Paul Beame Joan Lawry Department of Computer Science and Engineering, FR-35 University of Washington Seattle, Washington 98195 Our main result is the demonstration of a Boolean fu...
Paul Beame, Joan Lawry
104
Voted
SODA
2001
ACM
138views Algorithms» more  SODA 2001»
14 years 11 months ago
The diameter of random massive graphs
Many massive graphs (such as the WWW graph and Call graphs) share certain universal characteristics which can be described by so-called the "power law". Here we determin...
Linyuan Lu
83
Voted
RECOMB
2008
Springer
15 years 10 months ago
Algorithms for Joint Optimization of Stability and Diversity in Planning Combinatorial Libraries of Chimeric Proteins
Abstract. In engineering protein variants by constructing and screening combinatorial libraries of chimeric proteins, two complementary and competing goals are desired: the new pro...
Wei Zheng, Alan M. Friedman, Chris Bailey-Kellogg
GECCO
2010
Springer
155views Optimization» more  GECCO 2010»
15 years 3 months ago
Negative selection algorithms without generating detectors
Negative selection algorithms are immune-inspired classifiers that are trained on negative examples only. Classification is performed by generating detectors that match none of ...
Maciej Liskiewicz, Johannes Textor