Sciweavers

2272 search results - page 26 / 455
» Capture Complexity by Partition
Sort
View
80
Voted
WWW
2007
ACM
15 years 10 months ago
A unified platform for data driven web applications with automatic client-server partitioning
Data-driven web applications are usually structured in three tiers with different programming models at each tier. This division forces developers to manually partition applicatio...
Fan Yang 0002, Nitin Gupta 0003, Nicholas Gerner, ...
ASPDAC
1999
ACM
122views Hardware» more  ASPDAC 1999»
15 years 2 months ago
A Clustering Based Linear Ordering Algorithm for K-Way Spectral Partitioning
The spectral method can lead to a high quality of multi-way partition due to its ability to capture global netlist information. For spectral partition, n netlist modules are mappe...
Shiuann-Shiuh Lin, Wen-Hsin Chen, Wen-Wei Lin, Tin...
DATE
2006
IEEE
202views Hardware» more  DATE 2006»
15 years 3 months ago
Automatic systemC design configuration for a faster evaluation of different partitioning alternatives
In this paper we present a methodology that is based on SystemC [1] for rapid prototyping to greatly enhance and accelerate the exploration of complex systems to optimize the syst...
Nico Bannow, Karsten Haug, Wolfgang Rosenstiel
APPROX
2006
Springer
126views Algorithms» more  APPROX 2006»
15 years 1 months ago
Better Approximations for the Minimum Common Integer Partition Problem
Abstract. In the k-Minimum Common Integer Partition Problem, abbreviated k-MCIP, we are given k multisets X1, . . . , Xk of positive integers, and the goal is to find an integer mu...
David P. Woodruff
INFORMATICASI
1998
122views more  INFORMATICASI 1998»
14 years 9 months ago
Experimental Evaluation of Three Partition Selection Criteria for Decision Table Decomposition
Decision table decomposition is a machine learning approach that decomposes a given decision table into an equivalent hierarchy of decision tables. The approach aims to discover d...
Blaz Zupan, Marko Bohanec