Sciweavers

18306 search results - page 320 / 3662
» Algorithmics in Exponential Time
Sort
View
ECAI
2008
Springer
15 years 8 months ago
Online Rule Learning via Weighted Model Counting
Online multiplicative weight-update learning algorithms, such as Winnow, have proven to behave remarkably for learning simple disjunctions with few relevant attributes. The aim of ...
Frédéric Koriche
LOPSTR
2004
Springer
16 years 4 days ago
Fully Automatic Binding-Time Analysis for Prolog
Offline partial evaluation techniques rely on an annotated version of the source program to control the specialisation process. These annotations guide the specialisation and have ...
Stephen-John Craig, John P. Gallagher, Michael Leu...
EUROPAR
2003
Springer
16 years 16 min ago
Dynamic Load Partitioning Strategies for Managing Data of Space and Time Heterogeneity in Parallel SAMR Applications
This paper presents the design and experimental evaluation of two dynamic load partitioning and balancing strategies for parallel Structured Adaptive Mesh Refinement (SAMR) applic...
Xiaolin Li, Manish Parashar
AAAI
2010
15 years 8 months ago
Filtering Bounded Knapsack Constraints in Expected Sublinear Time
We present a highly efficient incremental algorithm for propagating bounded knapsack constraints. Our algorithm is based on the sublinear filtering algorithm for binary knapsack c...
Yuri Malitsky, Meinolf Sellmann, Radoslaw Szymanek
SIAMCOMP
2012
13 years 9 months ago
Randomized Competitive Algorithms for Generalized Caching
We consider online algorithms for the generalized caching problem. Here we are given a cache of size k and pages with arbitrary sizes and fetching costs. Given a request sequence ...
Nikhil Bansal, Niv Buchbinder, Joseph Naor