Sciweavers

1964 search results - page 66 / 393
» Partitioning Based Algorithms for Some Colouring Problems
Sort
View
ASPDAC
1999
ACM
77views Hardware» more  ASPDAC 1999»
14 years 3 days ago
Timing-Driven Bipartitioning with Replication Using Iterative Quadratic Programming
We present an algorithm for solving a general min-cut, twoway partitioning problem subject to timing constraints. The problem is formulated as a constrained programming problem an...
Shihliang Ou, Massoud Pedram
SIGPRO
2008
106views more  SIGPRO 2008»
13 years 7 months ago
Propagator-based methods for recursive subspace model identification
The problem of the online identification of multi-input multi-output (MIMO) state-space models in the framework of discrete-time subspace methods is considered in this paper. Seve...
Guillaume Mercère, Laurent Bako, Sté...
SAT
2007
Springer
95views Hardware» more  SAT 2007»
14 years 1 months ago
Solving Multi-objective Pseudo-Boolean Problems
Integer Linear Programs are widely used in areas such as routing problems, scheduling analysis and optimization, logic synthesis, and partitioning problems. As many of these proble...
Martin Lukasiewycz, Michael Glaß, Christian ...
DEXAW
2005
IEEE
356views Database» more  DEXAW 2005»
14 years 1 months ago
Grid Visualizer: A Monitoring Tool for Grid Environment
One specific problem in wide-area distributed computing environment is effective management of the vast amount of resources that are made available within the grid environment. Th...
Ghazala Shaheen, Muhammad Usman Malik, Zohair Ihsa...
ISCC
2006
IEEE
154views Communications» more  ISCC 2006»
14 years 1 months ago
Decentralized Load Balancing for Highly Irregular Search Problems
In this paper, we present a Dynamic Load Balancing (DLB) policy for problems characterized by a highly irregular search tree, whereby no reliable workload prediction is available....
Giuseppe Di Fatta, Michael R. Berthold