Sciweavers

1576 search results - page 133 / 316
» Streaming Algorithms for Independent Sets
Sort
View
85
Voted
AI
2008
Springer
14 years 10 months ago
Alternating-offers bargaining with one-sided uncertain deadlines: an efficient algorithm
In the arena of automated negotiations we focus on the principal negotiation protocol in bilateral settings, i.e. the alternatingoffers protocol. In the scientific community it is...
Nicola Gatti, Francesco Di Giunta, Stefano Marino
74
Voted
JAIR
2008
103views more  JAIR 2008»
14 years 10 months ago
SATzilla: Portfolio-based Algorithm Selection for SAT
It has been widely observed that there is no single "dominant" SAT solver; instead, different solvers perform best on different instances. Rather than following the trad...
Lin Xu, Frank Hutter, Holger H. Hoos, Kevin Leyton...
83
Voted
DCC
2002
IEEE
15 years 9 months ago
Bit Allocation in Sub-linear Time and the Multiple-Choice Knapsack Problem
We show that the problem of optimal bit allocation among a set of independent discrete quantizers given a budget constraint is equivalent to the multiple choice knapsack problem (...
Alexander E. Mohr
WCE
2007
14 years 11 months ago
A mathematical study of the pantograph/catenary dynamic interaction on transition spans
—This paper presents the work carried out by CALPE team on the development of a mathematical model used in the study and simulation of the pantograph-catenarydynamic interaction ...
Jesús Benet, Angelines Alberto, Enrique Ari...
IDA
2008
Springer
14 years 10 months ago
A comprehensive analysis of hyper-heuristics
Meta-heuristics such as simulated annealing, genetic algorithms and tabu search have been successfully applied to many difficult optimization problems for which no satisfactory pro...
Ender Özcan, Burak Bilgin, Emin Erkan Korkmaz