Sciweavers

1170 search results - page 59 / 234
» How Fast Is Too Fast
Sort
View
GECCO
2008
Springer
103views Optimization» more  GECCO 2008»
15 years 3 months ago
How generative encodings fare on less regular problems
Generative representations allow the reuse of code and thus facilitate the evolution of repeated phenotypic themes or modules. It has been shown that generative representations pe...
Jeff Clune, Charles Ofria, Robert T. Pennock
PE
2006
Springer
111views Optimization» more  PE 2006»
15 years 2 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...
RECOMB
2007
Springer
16 years 3 months ago
How to Achieve an Equivalent Simple Permutation in Linear Time
The problem of Sorting signed permutations by reversals is a well studied problem in computational biology. The first polynomial time algorithm was presented by Hannenhalli and Pev...
Simon Gog, Martin Bader
MICRO
2005
IEEE
108views Hardware» more  MICRO 2005»
15 years 8 months ago
How to Fake 1000 Registers
Large numbers of logical registers can improve performance by allowing fast access to multiple subroutine contexts (register windows) and multiple thread contexts (multithreading)...
David W. Oehmke, Nathan L. Binkert, Trevor N. Mudg...
TON
2008
160views more  TON 2008»
15 years 2 months ago
Label space reduction in MPLS networks: how much can a single stacked label do?
Most network operators have considered reducing LSR label spaces (number of labels used) as a way of simplifying management of underlaying Virtual Private Networks (VPNs) and there...
Fernando Solano, Thomas Stidsen, Ramón Fabr...