Sciweavers

590 search results - page 73 / 118
» Can We Learn to Beat the Best Stock
Sort
View
GECCO
2007
Springer
167views Optimization» more  GECCO 2007»
15 years 3 months ago
Genetically designed heuristics for the bin packing problem
The bin packing problem (BPP) is a real-world problem that arises in different industrial applications related to minimization of space or time. The aim of this research is to au...
Oana Muntean
SDMW
2004
Springer
15 years 3 months ago
Using Secret Sharing for Searching in Encrypted Data
When outsourcing data to an untrusted database server, the data should be encrypted. When using thin clients or low-bandwidth networks it is best to perform most of the work at the...
Richard Brinkman, Jeroen Doumen, Willem Jonker
ACL
2006
14 years 11 months ago
Discriminative Classifiers for Deterministic Dependency Parsing
Deterministic parsing guided by treebankinduced classifiers has emerged as a simple and efficient alternative to more complex models for data-driven parsing. We present a systemat...
Johan Hall, Joakim Nivre, Jens Nilsson
ICCAD
2009
IEEE
96views Hardware» more  ICCAD 2009»
14 years 7 months ago
PSTA-based branch and bound approach to the silicon speedpath isolation problem
The lack of good "correlation" between pre-silicon simulated delays and measured delays on silicon (silicon data) has spurred efforts on so-called silicon debug. The ide...
Sari Onaissi, Khaled R. Heloue, Farid N. Najm
ATAL
2011
Springer
13 years 9 months ago
Game theory-based opponent modeling in large imperfect-information games
We develop an algorithm for opponent modeling in large extensive-form games of imperfect information. It works by observing the opponent’s action frequencies and building an opp...
Sam Ganzfried, Tuomas Sandholm