Sciweavers

11121 search results - page 1823 / 2225
» Computing with Continuous Change
Sort
View
APPROX
2007
Springer
100views Algorithms» more  APPROX 2007»
16 years 13 days ago
Implementing Huge Sparse Random Graphs
Consider a scenario where one desires to simulate the execution of some graph algorithm on random input graphs of huge, perhaps even exponential size. Sampling and storing these h...
Moni Naor, Asaf Nussboim
ATAL
2007
Springer
16 years 13 days ago
Batch reinforcement learning in a complex domain
Temporal difference reinforcement learning algorithms are perfectly suited to autonomous agents because they learn directly from an agent’s experience based on sequential actio...
Shivaram Kalyanakrishnan, Peter Stone
CCS
2007
ACM
16 years 13 days ago
Implementing and testing dynamic timeout adjustment as a dos counter-measure
In this paper we experimentally analyse various dynamic timeout adjustment strategies in server queues as potential counter-measures against degradation of service attacks. Previo...
Daniel Boteanu, Edouard Reich, José M. Fern...
GECCO
2007
Springer
214views Optimization» more  GECCO 2007»
16 years 13 days ago
Portfolio allocation using XCS experts in technical analysis, market conditions and options market
Schulenburg [15] first proposed the idea to model different trader types by supplying different input information sets to a group of homogenous LCS agent. Gershoff [12] investigat...
Sor Ying (Byron) Wong, Sonia Schulenburg
HIPEAC
2007
Springer
16 years 13 days ago
Fetch Gating Control Through Speculative Instruction Window Weighting
In a dynamic reordering superscalar processor, the front-end fetches instructions and places them in the issue queue. Instructions are then issued by the back-end execution core. T...
Hans Vandierendonck, André Seznec
« Prev « First page 1823 / 2225 Last » Next »