Sciweavers

197 search results - page 26 / 40
» Complexity of Max-SAT using stochastic algorithms
Sort
View
242
Voted
SIGECOM
2011
ACM
320views ECommerce» more  SIGECOM 2011»
14 years 4 months ago
Market making and mean reversion
Market making refers broadly to trading strategies that seek to profit by providing liquidity to other traders, while avoiding accumulating a large net position in a stock. In th...
Tanmoy Chakraborty, Michael Kearns
IAT
2009
IEEE
15 years 8 months ago
Optimization-Based Collision Avoidance for Cooperating Airplanes
Application of autonomous intelligent systems into airspace domain is very important nowadays. The paper presents decentralized collision avoidance algorithm utilizing a solution ...
David Sislák, Premysl Volf, Michal Pechouce...
114
Voted
WSCG
2004
142views more  WSCG 2004»
15 years 3 months ago
Metropolis Iteration for Global Illumination
This paper presents a stochastic iteration algorithm solving the global illumination problem, where the random sampling is governed by classical importance sampling and also by th...
László Szirmay-Kalos, Bálazs ...
WIOPT
2011
IEEE
14 years 5 months ago
Performance evaluation of resource allocation policies for energy harvesting devices
Abstract—We focus on resource allocation for energy harvesting devices. We analytically and numerically evaluate the performance of algorithms that determine time fair energy all...
Maria Gorlatova, Andrey Bernstein, Gil Zussman
SAT
2010
Springer
158views Hardware» more  SAT 2010»
15 years 5 months ago
Dynamic Scoring Functions with Variable Expressions: New SLS Methods for Solving SAT
Abstract. We introduce a new conceptual model for representing and designing Stochastic Local Search (SLS) algorithms for the propositional satisfiability problem (SAT). Our model...
Dave A. D. Tompkins, Holger H. Hoos