Sciweavers

1034 search results - page 83 / 207
» Competitive generalized auctions
Sort
View
91
Voted
FOCS
2004
IEEE
15 years 4 months ago
Optimal Power-Down Strategies
We consider the problem of selecting threshold times to transition a device to low-power sleep states during an idle period. The two-state case in which there is a single active a...
John Augustine, Sandy Irani, Chaitanya Swamy
SODA
2003
ACM
102views Algorithms» more  SODA 2003»
15 years 1 months ago
Online paging with arbitrary associativity
We tackle the problem of online paging on two level memories with arbitrary associativity (including victim caches, skewed caches etc.). We show that some important classes of pag...
Enoch Peserico
64
Voted
GECCO
2007
Springer
124views Optimization» more  GECCO 2007»
15 years 6 months ago
Origin of bursts
The phenomenon of particle bursts, a well-known feature of PSO is investigated. Their origin is concluded to lie in multiplicative stochasticity, previously encountered in the stu...
Tim Blackwell, Daniel Bratton
89
Voted
ESANN
2003
15 years 1 months ago
Robust Topology Representing Networks
Martinetz and Schulten proposed the use of a Competitive Hebbian Learning (CHL) rule to build Topology Representing Networks. From a set of units and a data distribution, a link i...
Michaël Aupetit
103
Voted
CLEF
2010
Springer
15 years 1 months ago
Exploring Fingerprinting as External Plagiarism Detection Method - Lab Report for PAN at CLEF 2010
This paper outlines the main approach and the general design of the plagiarism detection prototype application we have developed to take part in the 2nd International Plagiarism De...
Yurii Palkovskii, Alexei Belov, Irina Muzika