Sciweavers

1350 search results - page 8 / 270
» Generalized Committed Choice
Sort
View
TKDE
2010
168views more  TKDE 2010»
14 years 7 months ago
Completely Lazy Learning
—Local classifiers are sometimes called lazy learners because they do not train a classifier until presented with a test sample. However, such methods are generally not complet...
Eric K. Garcia, Sergey Feldman, Maya R. Gupta, San...
PKC
1999
Springer
125views Cryptology» more  PKC 1999»
15 years 1 months ago
Anonymous Fingerprinting Based on Committed Oblivious Transfer
Abstract. Thwarting unlawful redistribution of information sold electronically is a major problem of information-based electronic commerce. Anonymous fingerprinting has appeared a...
Josep Domingo-Ferrer
IOR
2007
100views more  IOR 2007»
14 years 9 months ago
Competition in Service Industries
We analyze a general market for an industry of competing service facilities. Firms differentiate themselves by their price levels and the waiting time their customers experience,...
Gad Allon, Awi Federgruen
GECCO
2007
Springer
326views Optimization» more  GECCO 2007»
15 years 3 months ago
Binary differential evolution for the unit commitment problem
The Unit Commitment Problem (UCP) is the task of finding an optimal turn on and turn off schedule for a group of power generation units over a given time horizon to minimize ope...
Ali Keles
GECCO
1999
Springer
15 years 1 months ago
Large Populations Are Not Always The Best Choice In Genetic Programming
In genetic programming a general consensus is that the population should be as large as practically possible or sensible. In this paper we examine a batch of problems of combinato...
Matthias Fuchs