Sciweavers

221 search results - page 29 / 45
» An Empirical Evaluation of Client-Side Server Selection Algo...
Sort
View
ML
2006
ACM
113views Machine Learning» more  ML 2006»
13 years 8 months ago
Learning to bid in bridge
Bridge bidding is considered to be one of the most difficult problems for game-playing programs. It involves four agents rather than two, including a cooperative agent. In additio...
Asaf Amit, Shaul Markovitch
MIDDLEWARE
2009
Springer
14 years 1 months ago
How to Keep Your Head above Water While Detecting Errors
Today’s distributed systems need runtime error detection to catch errors arising from software bugs, hardware errors, or unexpected operating conditions. A prominent class of err...
Ignacio Laguna, Fahad A. Arshad, David M. Grothe, ...
BROADNETS
2006
IEEE
14 years 2 months ago
Distributed Job Scheduling based on Multiple Constraints Anycast Routing
— As the popularity of resource-constrained devices such as hand-held computers increases, a new network service offloading complex processing tasks towards computational resour...
Tim Stevens, Marc De Leenheer, Filip De Turck, Bar...
SIGMOD
2009
ACM
157views Database» more  SIGMOD 2009»
14 years 8 months ago
Asynchronous view maintenance for VLSD databases
The query models of the recent generation of very large scale distributed (VLSD) shared-nothing data storage systems, including our own PNUTS and others (e.g. BigTable, Dynamo, Ca...
Parag Agrawal, Adam Silberstein, Brian F. Cooper, ...
EUROGP
2007
Springer
126views Optimization» more  EUROGP 2007»
14 years 15 days ago
Training Binary GP Classifiers Efficiently: A Pareto-coevolutionary Approach
The conversion and extension of the Incremental Pareto-Coevolution Archive algorithm (IPCA) into the domain of Genetic Programming classification is presented. In particular, the ...
Michal Lemczyk, Malcolm I. Heywood