Sciweavers

364 search results - page 5 / 73
» A benchmark for the sorting network problem
Sort
View
SPAA
2009
ACM
14 years 3 months ago
A randomized, o(log w)-depth 2 smoothing network
A K-smoothing network is a distributed, low-contention data structure where tokens arrive arbitrarily on w input wires and reach w output wires via their completely asynchronous p...
Marios Mavronicolas, Thomas Sauerwald
ATS
2009
IEEE
138views Hardware» more  ATS 2009»
14 years 1 months ago
Test Pattern Selection for Potentially Harmful Open Defects in Power Distribution Networks
Power distribution network (PDN) designs for today’s high performance integrated circuits (ICs) typically occupy a significant share of metal resources in the circuit, and henc...
Yubin Zhang, Lin Huang, Feng Yuan, Qiang Xu
ESANN
2007
13 years 8 months ago
Several ways to solve the MSO problem
The so called MSO-problem, – a simple superposition of two or more sinusoidal waves –, has recently been discussed as a benchmark problem for reservoir computing and was shown ...
Jochen J. Steil
PPSN
2004
Springer
14 years 1 days ago
Multi-objective Optimisation by Co-operative Co-evolution
This paper presents the integration between a co-operative co-evolutionary genetic algorithm (CCGA) and four evolutionary multiobjective optimisation algorithms (EMOAs): a multi-ob...
Kuntinee Maneeratana, Kittipong Boonlong, Nachol C...
SIGECOM
2003
ACM
143views ECommerce» more  SIGECOM 2003»
13 years 12 months ago
Pricing WiFi at Starbucks: issues in online mechanism design
We consider the problem of designing mechanisms for online problems in which agents arrive over time and the mechanism is unaware of the agent until the agent announces her arriva...
Eric J. Friedman, David C. Parkes