Sciweavers

1547 search results - page 299 / 310
» Solving Knapsack Problems in a Sticker Based Model
Sort
View
CN
2007
137views more  CN 2007»
14 years 11 months ago
AID: A global anti-DoS service
Distributed denial of service (DDoS) has long been an open security problem of the Internet. Most proposed solutions require the upgrade of routers across the Internet, which is e...
Shigang Chen, Yibei Ling, Randy Chow, Ye Xia
JMLR
2006
124views more  JMLR 2006»
14 years 11 months ago
Policy Gradient in Continuous Time
Policy search is a method for approximately solving an optimal control problem by performing a parametric optimization search in a given class of parameterized policies. In order ...
Rémi Munos
IJRR
2007
100views more  IJRR 2007»
14 years 11 months ago
Exactly Sparse Extended Information Filters for Feature-based SLAM
Recent research concerning the Gaussian canonical form for Simultaneous Localization and Mapping (SLAM) has given rise to a handful of algorithms that attempt to solve the SLAM sc...
Matthew Walter, Ryan Eustice, John J. Leonard
PODS
2002
ACM
167views Database» more  PODS 2002»
15 years 11 months ago
OLAP Dimension Constraints
In multidimensional data models intended for online analytic processing (OLAP), data are viewed as points in a multidimensional space. Each dimension has structure, described by a...
Carlos A. Hurtado, Alberto O. Mendelzon
ICCAD
1993
IEEE
101views Hardware» more  ICCAD 1993»
15 years 3 months ago
Convexity-based algorithms for design centering
A new technique for design centering, and for polytope approximation of the feasible region for a design are presented. In the rst phase, the feasible region is approximated by a ...
Sachin S. Sapatnekar, Pravin M. Vaidya, Steve M. K...