Sciweavers

205 search results - page 5 / 41
» Efficient Algorithms for Universal Portfolios
Sort
View
KES
2008
Springer
14 years 9 months ago
Knowledge-based genetic algorithm for university course timetabling problems
This paper discusses a new solution to university course timetabling problems. The problems that belong to the NP-hard class are very difficult to solve using conventional optimiza...
Hitoshi Kanoh, Yuusuke Sakamoto
SODA
2004
ACM
173views Algorithms» more  SODA 2004»
14 years 11 months ago
Tabulation based 4-universal hashing with applications to second moment estimation
We show that 4-universal hashing can be implemented efficiently using tabulated 4-universal hashing for characters, gaining a factor of 5 in speed over the fastest existing method...
Mikkel Thorup, Yin Zhang
SODA
2000
ACM
105views Algorithms» more  SODA 2000»
14 years 10 months ago
Efficient dynamic traitor tracing
This presentation covers several sections of the paper by Berkman, Parnas and Sgall for the Advanced Topics in Network Security seminar. Ben-Gurion University of the Negev, fall 2...
Omer Berkman, Michal Parnas, Jiri Sgall
IOR
2010
71views more  IOR 2010»
14 years 6 months ago
Stochastic Root Finding and Efficient Estimation of Convex Risk Measures
Reliable risk measurement is a key problem for financial institutions and regulatory authorities. The current industry standard Value-at-Risk has several deficiencies. Improved ri...
Jörn Dunkel, Stefan Weber
JPDC
2006
148views more  JPDC 2006»
14 years 9 months ago
Efficient algorithm for placing a given number of base stations to cover a convex region
In the context of mobile communication, an efficient algorithm for the base-station placement problem is developed in this paper. The objective is to place a given number of base-...
Gautam K. Das, Sandip Das, Subhas C. Nandy, Bhaban...