Sciweavers

344 search results - page 53 / 69
» The Santa Claus problem
Sort
View
ICGI
2010
Springer
13 years 7 months ago
Exact DFA Identification Using SAT Solvers
Abstract. We present an exact algorithm for identification of deterministic finite automata (DFA) which is based on satisfiability (SAT) solvers. Despite the size of the low level ...
Marijn J. H. Heule, Sicco Verwer
SIGMOD
2001
ACM
213views Database» more  SIGMOD 2001»
14 years 10 months ago
Bit-Sliced Index Arithmetic
The bit-sliced index (BSI) was originally defined in [ONQ97]. The current paper introduces the concept of BSI arithmetic. For any two BSI's X and Y on a table T, we show how ...
Denis Rinfret, Patrick E. O'Neil, Elizabeth J. O'N...
ICC
2008
IEEE
114views Communications» more  ICC 2008»
14 years 4 months ago
Optimal Statistical Tuning of the RED Parameters
Abstract— Achieving minimal loss while satisfying an acceptable delay profile remains to be an open problem under the RED queuing discipline. In this paper, we present a framewo...
Homayoun Yousefi'zadeh, Amir Habibi, Hamid Jafarkh...
GECCO
2009
Springer
121views Optimization» more  GECCO 2009»
14 years 2 months ago
Using memetic algorithms to improve portfolio performance in static and dynamic trading scenarios
The Portfolio Optimization problem consists of the selection of a group of assets to a long-term fund in order to minimize the risk and maximize the return of the investment. This...
Claus de Castro Aranha, Hitoshi Iba
AAAI
2008
14 years 5 days ago
Relaxed Survey Propagation: A Sum-Product Algorithm for Max-SAT
The survey propagation (SP) algorithm has been shown to work well on large instances of the random 3-SAT problem near its phase transition. It was shown that SP estimates marginal...
Hai Leong Chieu, Wee Sun Lee