Sciweavers

2157 search results - page 256 / 432
» Optimal Fast Hashing
Sort
View
135
Voted
GECCO
2008
Springer
113views Optimization» more  GECCO 2008»
15 years 4 months ago
Genetic programming based automatic gait generation for quadruped robots
This paper introduces a new approach to develop a fast gait for quadruped robot using genetic programming (GP). Several recent approaches have focused on the genetic algorithm (GA...
Kisung Seo, Soohwan Hyun
CORR
2010
Springer
167views Education» more  CORR 2010»
15 years 3 months ago
Network Flow Algorithms for Structured Sparsity
We consider a class of learning problems that involve a structured sparsityinducing norm defined as the sum of -norms over groups of variables. Whereas a lot of effort has been pu...
Julien Mairal, Rodolphe Jenatton, Guillaume Obozin...
JMLR
2006
117views more  JMLR 2006»
15 years 3 months ago
On the Complexity of Learning Lexicographic Strategies
Fast and frugal heuristics are well studied models of bounded rationality. Psychological research has proposed the take-the-best heuristic as a successful strategy in decision mak...
Michael Schmitt, Laura Martignon
118
Voted
MONET
2008
135views more  MONET 2008»
15 years 3 months ago
Understanding the Power of Distributed Coordination for Dynamic Spectrum Management
This paper investigates a distributed and adaptive approach to manage spectrum usage in dynamic spectrum access networks. While previous works focus on centralized provisioning, w...
Lili Cao, Haitao Zheng
PE
2006
Springer
111views Optimization» more  PE 2006»
15 years 3 months ago
How many servers are best in a dual-priority M/PH/k system?
We ask the question, "for minimizing mean response time (sojourn time), which is preferable: one fast server of speed 1, or k slow servers each of speed 1/k?" Our settin...
Adam Wierman, Takayuki Osogami, Mor Harchol-Balter...