Sciweavers

14071 search results - page 2739 / 2815
» Fundamentals of simulation modeling
Sort
View
APPROX
2007
Springer
100views Algorithms» more  APPROX 2007»
14 years 3 months 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
14 years 3 months ago
Distributed management of flexible times schedules
In this paper we consider the problem of managing and exploiting schedules in an uncertain and distributed environment. We assume a team of collaborative agents, each responsible ...
Stephen F. Smith, Anthony Gallagher, Terry L. Zimm...
ATAL
2007
Springer
14 years 3 months ago
Bidding optimally in concurrent second-price auctions of perfectly substitutable goods
We derive optimal bidding strategies for a global bidding agent that participates in multiple, simultaneous second-price auctions with perfect substitutes. We first consider a mo...
Enrico H. Gerding, Rajdeep K. Dash, David C. K. Yu...
AUSAI
2007
Springer
14 years 3 months ago
Merging Algorithm to Reduce Dimensionality in Application to Web-Mining
Dimensional reduction may be effective in order to compress data without loss of essential information. Also, it may be useful in order to smooth data and reduce random noise. The...
Vladimir Nikulin, Geoffrey J. McLachlan
CCS
2007
ACM
14 years 3 months 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...
« Prev « First page 2739 / 2815 Last » Next »