Sciweavers

7228 search results - page 349 / 1446
» From Algorithmic to Subjective Randomness
Sort
View
133
Voted
GECCO
2005
Springer
153views Optimization» more  GECCO 2005»
15 years 10 months ago
Finding needles in haystacks is harder with neutrality
This research presents an analysis of the reported successes of the Cartesian Genetic Programming method on a simplified form of the Boolean parity problem. We show the method of...
M. Collins
119
Voted
MANSCI
2008
75views more  MANSCI 2008»
15 years 5 months ago
Staffing Multiskill Call Centers via Linear Programming and Simulation
We study an iterative cutting-plane algorithm on an integer program, for minimizing the staffing costs of a multiskill call center subject to service-level requirements which are e...
Mehmet Tolga Çezik, Pierre L'Ecuyer
SIAMJO
2008
76views more  SIAMJO 2008»
15 years 5 months ago
Identification and Elimination of Interior Points for the Minimum Enclosing Ball Problem
Given A := {a1, . . . , am} Rn, we consider the problem of reducing the input set for the computation of the minimum enclosing ball of A. In this note, given an approximate soluti...
S. Damla Ahipasaoglu, E. Alper Yildirim
FGCS
2010
108views more  FGCS 2010»
15 years 3 months ago
The wandering token: Congestion avoidance of a shared resource
In a distributed system where scalability is an issue, like in a GRID [5], the problem of enforcing mutual exclusion often arises in a soft form: the infrequent failure of the mut...
Augusto Ciuffoletti
INFOCOM
2011
IEEE
14 years 8 months ago
Utility optimization for dynamic peer-to-peer networks with tit-for-tat constraints
— We consider a peer-to-peer network where nodes can send and receive files amongst their peers. File requests are generated randomly, and each new file can correspond to a dif...
Michael J. Neely, Leana Golubchik