Sciweavers

1884 search results - page 225 / 377
» Simple Algorithm for Simple Timed Games
Sort
View
CSDA
2008
158views more  CSDA 2008»
15 years 6 months ago
Outlier identification in high dimensions
A computationally fast procedure for identifying outliers is presented, that is particularly effective in high dimensions. This algorithm utilizes simple properties of principal c...
Peter Filzmoser, Ricardo A. Maronna, Mark Werner
IOR
2006
75views more  IOR 2006»
15 years 6 months ago
Sensitivity of Performance in the Erlang-A Queueing Model to Changes in the Model Parameters
This paper studies the M/M/s+M queue, i.e., the M/M/s queue with customer abandonment, also called the Erlang-A model, having independent and identically distributed customer aban...
Ward Whitt
JGTOOLS
2007
144views more  JGTOOLS 2007»
15 years 6 months ago
Faster Relief Mapping using the Secant Method
Relief mapping using the secant method offers an efficient method for adding per pixel height field based displacement to an arbitrary polygonal mesh in real time. The technique...
Eric Risser, Musawir Shah, Sumanta N. Pattanaik
ALIFE
1998
15 years 5 months ago
Self-Adaptation in Evolving Systems
A theoretical and experimental analysis is made of the effects of self-adaptation in a simple evolving system. Specifically, we consider the effects of coding the mutation and ...
Christopher R. Stephens, I. Garcia Olmedo, J. Mora...
INFOCOM
2010
IEEE
15 years 4 months ago
High-Speed Per-Flow Traffic Measurement with Probabilistic Multiplicity Counting
On today's high-speed backbone network links, measuring per-flow traffic information has become very challenging. Maintaining exact per-flow packet counters on OC-192 or OC-76...
Peter Lieven, Björn Scheuermann