Sciweavers

313 search results - page 11 / 63
» Complete Local Search with Memory
Sort
View
TIP
2010
90views more  TIP 2010»
13 years 4 months ago
Fast Query for Exemplar-Based Image Completion
In this paper, we present a fast algorithm for filling unknown regions in an image using the strategy of exemplarmatching. Unlike the original exemplar-based method using exhaustiv...
Tsz-Ho Kwok, Hoi Sheung, Charlie C. L. Wang
IPPS
2000
IEEE
14 years 2 months ago
Memory Management in a Combined VIA/SCI Hardware
Abstract In this document we make a brief review of memory management and DMA considerations in case of common SCI hardware and the Virtual Interface Architecture. On this basis we...
Mario Trams, Wolfgang Rehm, Daniel Balkanski, Stan...
CP
2009
Springer
14 years 1 months ago
Constraint-Based Local Search for the Automatic Generation of Architectural Tests
Abstract. This paper considers the automatic generation of architectural tests (ATGP), a fundamental problem in processor validation. ATGPs are complex conditional constraint satis...
Pascal Van Hentenryck, Carleton Coffrin, Boris Gut...
ATAL
2003
Springer
14 years 3 months ago
An asynchronous complete method for distributed constraint optimization
We present a new polynomial-space algorithm, called Adopt, for distributed constraint optimization (DCOP). DCOP is able to model a large class of collaboration problems in multi-a...
Pragnesh Jay Modi, Wei-Min Shen, Milind Tambe, Mak...
ISLPED
1997
ACM
95views Hardware» more  ISLPED 1997»
14 years 2 months ago
Formalized methodology for data reuse exploration in hierarchical memory mappings
Efficient use of an optimized memory hierarchy to exploit temporal locality in the memory accesses on array signals can have a very large impact on the power consumption in data ...
Jean-Philippe Diguet, Sven Wuytack, Francky Cattho...