Sciweavers

1078 search results - page 20 / 216
» Local and Global Relational Consistency
Sort
View
ESWA
2007
100views more  ESWA 2007»
13 years 10 months ago
Using memetic algorithms with guided local search to solve assembly sequence planning
The goal of assembly planning consists in generating feasible sequences to assemble a product and selecting an efficient assembly sequence from which related constraint factors su...
Hwai-En Tseng, Wen-Pai Wang, Hsun-Yi Shih
SAT
2010
Springer
172views Hardware» more  SAT 2010»
13 years 9 months ago
On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem
Algorithms based on local search are popular for solving many optimization problems including the maximum satisfiability problem (MAXSAT). With regard to MAXSAT, the state of the ...
Denis Pankratov, Allan Borodin
ANOR
2007
151views more  ANOR 2007»
13 years 11 months ago
Distributed personnel scheduling - negotiation among scheduling agents
This paper introduces a model for Distributed Employee Timetabling Problems (DisETPs) and proposes a general architecture for solving DisETPs by using a Multi Agent System (MAS) pa...
Eliezer Kaplansky, Amnon Meisels
TVCG
2010
161views more  TVCG 2010»
13 years 9 months ago
Globally Optimized Linear Windowed Tone Mapping
—This paper introduces a new tone mapping operator that performs local linear adjustments on small overlapping windows over the entire input image. While each window applies a lo...
Qi Shan, Jiaya Jia, Michael S. Brown
HPCA
1997
IEEE
14 years 3 months ago
Global Address Space, Non-Uniform Bandwidth: A Memory System Performance Characterization of Parallel Systems
Many parallel systems offer a simple view of memory: all storage cells are addresseduniformly. Despite a uniform view of the memory, the machines differsignificantly in theirmemo...
Thomas Stricker, Thomas R. Gross