Sciweavers

1688 search results - page 261 / 338
» Implementing Optimizations at Decode Time
Sort
View
NSDI
2004
13 years 9 months ago
Designing a DHT for Low Latency and High Throughput
Designing a wide-area distributed hash table (DHT) that provides high-throughput and low-latency network storage is a challenge. Existing systems have explored a range of solution...
Frank Dabek, Jinyang Li, Emil Sit, James Robertson...
GECCO
2008
Springer
141views Optimization» more  GECCO 2008»
13 years 9 months ago
Managing team-based problem solving with symbiotic bid-based genetic programming
Bid-based Genetic Programming (GP) provides an elegant mechanism for facilitating cooperative problem decomposition without an a priori specification of the number of team member...
Peter Lichodzijewski, Malcolm I. Heywood
JAR
2006
236views more  JAR 2006»
13 years 8 months ago
Deciding Boolean Algebra with Presburger Arithmetic
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
Viktor Kuncak, Huu Hai Nguyen, Martin C. Rinard
TACAS
2010
Springer
255views Algorithms» more  TACAS 2010»
13 years 6 months ago
Satisfiability Modulo the Theory of Costs: Foundations and Applications
Abstract. We extend the setting of Satisfiability Modulo Theories (SMT) by introducing a theory of costs C, where it is possible to model and reason about resource consumption and ...
Alessandro Cimatti, Anders Franzén, Alberto...
AIPS
2011
12 years 11 months ago
Where Ignoring Delete Lists Works, Part II: Causal Graphs
The ignoring delete lists relaxation is of paramount importance for both satisficing and optimal planning. In earlier work (Hoffmann 2005), it was observed that the optimal relax...
Joerg Hoffmann