Sciweavers

5214 search results - page 131 / 1043
» The Online Specialization Problem
Sort
View
ICIP
2001
IEEE
14 years 11 months ago
An evolving localised learning model for on-line image colour quantisation
Although widely studied for many years, colour quantisation remains a practical problem in image processing. Unlike previous works where the image can only be quantised after the ...
Da Deng, Nikola K. Kasabov
ISAAC
2009
Springer
92views Algorithms» more  ISAAC 2009»
14 years 4 months ago
Online Maximum Directed Cut
We investigate a natural online version of the well-known Maximum Directed Cut problem on DAGs. We propose a deterministic algorithm and show that it achieves a competitive ratio o...
Amotz Bar-Noy, Michael Lampis
ICRA
2006
IEEE
99views Robotics» more  ICRA 2006»
14 years 4 months ago
MRSAM: a Quadratically Competitive Multi-robot Online Navigation Algorithm
— We explore an online problem where a group of robots has to find a target whose position is unknown in an unknown planar environment whose geometry is acquired by the robots d...
Shahar Sarid, Amir Shapiro, Yoav Gabriely
COCOON
1999
Springer
14 years 2 months ago
Using Generalized Forecasts for Online Currency Conversion
El-Yaniv et al. presented an optimal on-line algorithm for the unidirectional currency conversion problem based on the threat-based strategy. Later, al-Binali pointed out that this...
Kazuo Iwama, Kouki Yonezawa
DISOPT
2008
59views more  DISOPT 2008»
13 years 10 months ago
More on online bin packing with two item sizes
We follow the work of [7] and study the online bin packing problem, where every item has one of two possible sizes which are known in advance. We focus on the parametric case, whe...
Leah Epstein, Asaf Levin