Sciweavers

20 search results - page 4 / 4
» Comparing global and local mutations on bit strings
Sort
View
CPHYSICS
2006
182views more  CPHYSICS 2006»
13 years 5 months ago
MinFinder: Locating all the local minima of a function
A new stochastic clustering algorithm is introduced that aims to locate all the local minima of a multidimensional continuous and differentiable function inside a bounded domain. ...
Ioannis G. Tsoulos, Isaac E. Lagaris
LCTRTS
1999
Springer
13 years 9 months ago
Why SpecInt95 Should Not Be Used to Benchmark Embedded Systems Tools
The SpecInt95 benchmark suite is often used to evaluate the performance of programming tools, including those used for embedded systems programming. Embedded applications, however...
Jakob Engblom
DC
2008
13 years 5 months ago
Approximate distributed top- k queries
We consider a distributed system where each node keeps a local count for items (similar to elections where nodes are ballot boxes and items are candidates). A top-k query in such ...
Boaz Patt-Shamir, Allon Shafrir
PODC
2010
ACM
13 years 9 months ago
Bayesian ignorance
We quantify the effect of Bayesian ignorance by comparing the social cost obtained in a Bayesian game by agents with local views to the expected social cost of agents having glob...
Noga Alon, Yuval Emek, Michal Feldman, Moshe Tenne...
CPHYSICS
2006
127views more  CPHYSICS 2006»
13 years 5 months ago
GenAnneal: Genetically modified Simulated Annealing
A modification of the standard Simulated Annealing (SA) algorithm is presented for finding the global minimum of a continuous multidimensional, multimodal function. We report resu...
Ioannis G. Tsoulos, Isaac E. Lagaris