Sciweavers

1298 search results - page 113 / 260
» The online set cover problem
Sort
View
PPL
2008
117views more  PPL 2008»
15 years 6 months ago
Operating Systems in silicon and the Dynamic Management of Resources in Many-Core Chips
This discussion paper explores the problems of operating systems support when implementing concurrency controls at the level of the instruction set in processors designed for mult...
Chris R. Jesshope
WWW
2008
ACM
16 years 7 months ago
Offline matching approximation algorithms in exchange markets
Motivated by several marketplace applications on rapidly growing online social networks, we study the problem of efficient offline matching algorithms for online exchange markets....
Zeinab Abbassi, Laks V. S. Lakshmanan
CIAC
2006
Springer
135views Algorithms» more  CIAC 2006»
15 years 10 months ago
Approximation Algorithms for Capacitated Rectangle Stabbing
In the rectangle stabbing problem we are given a set of axis parallel rectangles and a set of horizontal and vertical lines, and our goal is to find a minimum size subset of lines...
Guy Even, Dror Rawitz, Shimon Shahar
IJHIS
2007
89views more  IJHIS 2007»
15 years 6 months ago
A new hybrid heuristic for driver scheduling
This paper describes a new hybrid method based on the application of the Population Training Algorithm (PTA) and linear programming (LP) for generation of schedules for drivers in...
Geraldo R. Mauri, Luiz Antonio Nogueira Lorena
HIS
2008
15 years 8 months ago
Neural Plasticity and Minimal Topologies for Reward-Based Learning
Artificial Neural Networks for online learning problems are often implemented with synaptic plasticity to achieve adaptive behaviour. A common problem is that the overall learning...
Andrea Soltoggio