Sciweavers

66 search results - page 10 / 14
» Worst Cases of a Periodic Function for Large Arguments
Sort
View
RTS
2008
131views more  RTS 2008»
13 years 7 months ago
A constant-time dynamic storage allocator for real-time systems
Dynamic memory allocation has been used for decades. However, it has seldom been used in real-time systems since the worst case of spatial and temporal requirements for allocation ...
Miguel Masmano, Ismael Ripoll, Patricia Balbastre,...
PODS
2001
ACM
127views Database» more  PODS 2001»
14 years 7 months ago
Optimal Aggregation Algorithms for Middleware
Assume that each object in a database has m grades, or scores, one for each of m attributes. For example, an object can have a color grade, that tells how red it is, and a shape g...
Ronald Fagin, Amnon Lotem, Moni Naor
AI
2010
Springer
13 years 7 months ago
Automatically generating personalized user interfaces with Supple
Today's computer-human interfaces are typically designed with the assumption that they are going to be used by an able-bodied person, who is using a typical set of input and ...
Krzysztof Z. Gajos, Daniel S. Weld, Jacob O. Wobbr...
OL
2011
332views Neural Networks» more  OL 2011»
13 years 2 months ago
A robust implementation of a sequential quadratic programming algorithm with successive error restoration
We consider sequential quadratic programming (SQP) methods for solving constrained nonlinear programming problems. It is generally believed that SQP methods are sensitive to the a...
Klaus Schittkowski
CCCG
2010
13 years 9 months ago
On the variance of random polygons
A random polygon is the convex hull of uniformly distributed random points in a convex body K R2 . General upper bounds are established for the variance of the area of a random p...
William L. Steiger, Imre Bárány