Sciweavers

464 search results - page 16 / 93
» Memory Based on Abstraction for Dynamic Fitness Functions
Sort
View
SAT
2010
Springer
158views Hardware» more  SAT 2010»
15 years 1 months ago
Dynamic Scoring Functions with Variable Expressions: New SLS Methods for Solving SAT
Abstract. We introduce a new conceptual model for representing and designing Stochastic Local Search (SLS) algorithms for the propositional satisfiability problem (SAT). Our model...
Dave A. D. Tompkins, Holger H. Hoos
CLEIEJ
2002
113views more  CLEIEJ 2002»
14 years 9 months ago
The MT Stack: Paging Algorithm and Performance in a Distributed Virtual Memory System
Advances in parallel computation are of central importance to Artificial Intelligence due to the significant amount of time and space their programs require. Functional languages ...
Marco T. Morazán, Douglas R. Troeger, Myles...
GRAPHITE
2007
ACM
15 years 1 months ago
Compact and efficient generation of radiance transfer for dynamically articulated characters
We present a data-driven technique for generating the precomputed radiance transfer vectors of an animated character as a function of its joint angles. We learn a linear model for...
Derek Nowrouzezahrai, Patricio D. Simari, Evangelo...
OPODIS
2004
14 years 11 months ago
Lock-Free and Practical Doubly Linked List-Based Deques Using Single-Word Compare-and-Swap
Abstract. We present an efficient and practical lock-free implementation of a concurrent deque that supports parallelism for disjoint accesses and uses atomic primitives which are ...
Håkan Sundell, Philippas Tsigas
ISCAPDCS
2004
14 years 11 months ago
FG: A Framework Generator for Hiding Latency in Parallel Programs Running on Clusters
FG is a programming environment for asynchronous programs that run on clusters and fit into a pipeline framework. It enables the programmer to write a series of synchronous functi...
Thomas H. Cormen, Elena Riccio Davidson